./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.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_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/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_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/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_eeb30431-4db4-4e21-b835-2c54fee317b1/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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:19:16,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:19:16,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:19:16,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:19:16,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:19:16,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:19:16,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:19:16,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:19:16,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:19:16,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:19:16,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:19:16,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:19:16,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:19:16,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:19:16,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:19:16,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:19:16,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:19:16,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:19:16,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:19:16,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:19:16,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:19:16,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:19:16,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:19:16,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:19:16,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:19:16,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:19:16,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:19:16,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:19:16,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:19:16,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:19:16,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:19:16,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:19:16,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:19:16,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:19:16,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:19:16,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:19:16,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:19:16,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:19:16,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:19:16,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:19:16,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:19:16,646 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:19:16,670 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:19:16,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:19:16,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:19:16,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:19:16,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:19:16,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:19:16,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:19:16,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:19:16,672 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:19:16,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:19:16,673 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:19:16,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:19:16,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:19:16,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:19:16,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:19:16,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:19:16,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:19:16,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:19:16,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:19:16,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:19:16,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:19:16,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:19:16,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:19:16,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:19:16,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:19:16,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:19:16,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:19:16,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:19:16,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:19:16,683 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_eeb30431-4db4-4e21-b835-2c54fee317b1/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_eeb30431-4db4-4e21-b835-2c54fee317b1/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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2021-12-06 18:19:16,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:19:16,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:19:16,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:19:16,887 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:19:16,887 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:19:16,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-12-06 18:19:16,928 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/data/2e58610c4/8479d5a9a520452e8b71c914bb4a288b/FLAG98a905eee [2021-12-06 18:19:17,320 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:19:17,320 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-12-06 18:19:17,328 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/data/2e58610c4/8479d5a9a520452e8b71c914bb4a288b/FLAG98a905eee [2021-12-06 18:19:17,338 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/data/2e58610c4/8479d5a9a520452e8b71c914bb4a288b [2021-12-06 18:19:17,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:19:17,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:19:17,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:19:17,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:19:17,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:19:17,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448f6a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17, skipping insertion in model container [2021-12-06 18:19:17,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:19:17,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:19:17,564 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_eeb30431-4db4-4e21-b835-2c54fee317b1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-12-06 18:19:17,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:19:17,575 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:19:17,629 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_eeb30431-4db4-4e21-b835-2c54fee317b1/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2021-12-06 18:19:17,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:19:17,645 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:19:17,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17 WrapperNode [2021-12-06 18:19:17,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:19:17,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:19:17,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:19:17,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:19:17,652 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:19:17" (1/1) ... [2021-12-06 18:19:17,663 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:19:17" (1/1) ... [2021-12-06 18:19:17,695 INFO L137 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 405 [2021-12-06 18:19:17,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:19:17,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:19:17,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:19:17,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:19:17,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:19:17,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:19:17,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:19:17,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:19:17,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (1/1) ... [2021-12-06 18:19:17,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:19:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:17,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:19:17,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:19:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:19:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-12-06 18:19:17,808 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-12-06 18:19:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-06 18:19:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-06 18:19:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-12-06 18:19:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-12-06 18:19:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-12-06 18:19:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-12-06 18:19:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-12-06 18:19:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-12-06 18:19:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 18:19:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 18:19:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:19:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:19:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:19:17,896 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:19:17,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:19:18,254 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:19:18,261 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:19:18,261 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-06 18:19:18,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:18 BoogieIcfgContainer [2021-12-06 18:19:18,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:19:18,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:19:18,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:19:18,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:19:18,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:19:17" (1/3) ... [2021-12-06 18:19:18,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cbe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:18, skipping insertion in model container [2021-12-06 18:19:18,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:17" (2/3) ... [2021-12-06 18:19:18,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cbe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:18, skipping insertion in model container [2021-12-06 18:19:18,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:18" (3/3) ... [2021-12-06 18:19:18,268 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-12-06 18:19:18,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:19:18,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 18:19:18,307 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:19:18,313 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:19:18,313 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 18:19:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 142 states have (on average 1.591549295774648) internal successors, (226), 147 states have internal predecessors, (226), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-06 18:19:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 18:19:18,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:18,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:18,334 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2110673050, now seen corresponding path program 1 times [2021-12-06 18:19:18,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898071383] [2021-12-06 18:19:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:18,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,474 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:19:18,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:18,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898071383] [2021-12-06 18:19:18,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898071383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:18,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:18,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:18,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272477907] [2021-12-06 18:19:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:18,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:18,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:18,502 INFO L87 Difference]: Start difference. First operand has 187 states, 142 states have (on average 1.591549295774648) internal successors, (226), 147 states have internal predecessors, (226), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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:19:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:18,579 INFO L93 Difference]: Finished difference Result 375 states and 645 transitions. [2021-12-06 18:19:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:18,581 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:19:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:18,589 INFO L225 Difference]: With dead ends: 375 [2021-12-06 18:19:18,589 INFO L226 Difference]: Without dead ends: 191 [2021-12-06 18:19:18,594 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:19:18,597 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 18 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 835 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:19:18,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 835 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-06 18:19:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2021-12-06 18:19:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-06 18:19:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2021-12-06 18:19:18,652 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 15 [2021-12-06 18:19:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:18,653 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2021-12-06 18:19:18,653 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:19:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2021-12-06 18:19:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 18:19:18,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:18,655 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:19:18,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:19:18,656 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1922034334, now seen corresponding path program 1 times [2021-12-06 18:19:18,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857044064] [2021-12-06 18:19:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:18,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,705 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:19:18,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:18,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857044064] [2021-12-06 18:19:18,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857044064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:18,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:18,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:18,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728142840] [2021-12-06 18:19:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:18,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:18,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:18,709 INFO L87 Difference]: Start difference. First operand 189 states and 296 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:19:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:18,750 INFO L93 Difference]: Finished difference Result 391 states and 615 transitions. [2021-12-06 18:19:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:18,750 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:19:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:18,753 INFO L225 Difference]: With dead ends: 391 [2021-12-06 18:19:18,753 INFO L226 Difference]: Without dead ends: 205 [2021-12-06 18:19:18,754 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:19:18,755 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 25 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 856 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:19:18,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 856 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-06 18:19:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2021-12-06 18:19:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 155 states have (on average 1.5225806451612902) internal successors, (236), 159 states have internal predecessors, (236), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:19:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 312 transitions. [2021-12-06 18:19:18,771 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 312 transitions. Word has length 16 [2021-12-06 18:19:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:18,771 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 312 transitions. [2021-12-06 18:19:18,772 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:19:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 312 transitions. [2021-12-06 18:19:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 18:19:18,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:18,773 INFO L514 BasicCegarLoop]: trace histogram [2, 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:19:18,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:19:18,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -784914242, now seen corresponding path program 1 times [2021-12-06 18:19:18,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:18,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896777745] [2021-12-06 18:19:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:18,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:19:18,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896777745] [2021-12-06 18:19:18,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896777745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:18,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:18,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:19:18,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101985054] [2021-12-06 18:19:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:18,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:19:18,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:19:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:19:18,813 INFO L87 Difference]: Start difference. First operand 202 states and 312 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 18:19:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:18,830 INFO L93 Difference]: Finished difference Result 423 states and 661 transitions. [2021-12-06 18:19:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:19:18,831 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-12-06 18:19:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:18,833 INFO L225 Difference]: With dead ends: 423 [2021-12-06 18:19:18,833 INFO L226 Difference]: Without dead ends: 231 [2021-12-06 18:19:18,834 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:19:18,835 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 581 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:19:18,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 581 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-06 18:19:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 204. [2021-12-06 18:19:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 157 states have (on average 1.515923566878981) internal successors, (238), 161 states have internal predecessors, (238), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:19:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 314 transitions. [2021-12-06 18:19:18,850 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 314 transitions. Word has length 24 [2021-12-06 18:19:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:18,850 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 314 transitions. [2021-12-06 18:19:18,850 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 18:19:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 314 transitions. [2021-12-06 18:19:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 18:19:18,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:18,851 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:19:18,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:19:18,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1820136659, now seen corresponding path program 1 times [2021-12-06 18:19:18,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:18,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533510040] [2021-12-06 18:19:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:18,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:18,917 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:19:18,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:18,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533510040] [2021-12-06 18:19:18,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533510040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:18,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:18,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:18,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483749284] [2021-12-06 18:19:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:18,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:18,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:18,919 INFO L87 Difference]: Start difference. First operand 204 states and 314 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:19:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:18,949 INFO L93 Difference]: Finished difference Result 506 states and 798 transitions. [2021-12-06 18:19:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:18,949 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:19:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:18,952 INFO L225 Difference]: With dead ends: 506 [2021-12-06 18:19:18,952 INFO L226 Difference]: Without dead ends: 318 [2021-12-06 18:19:18,953 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:19:18,954 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:18,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1222 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-06 18:19:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 208. [2021-12-06 18:19:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 164 states have internal predecessors, (241), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2021-12-06 18:19:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2021-12-06 18:19:18,967 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 32 [2021-12-06 18:19:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:18,968 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2021-12-06 18:19:18,968 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:19:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2021-12-06 18:19:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 18:19:18,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:18,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:18,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:19:18,970 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1536399393, now seen corresponding path program 1 times [2021-12-06 18:19:18,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:18,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375546746] [2021-12-06 18:19:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:18,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 18:19:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,031 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:19:19,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:19,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375546746] [2021-12-06 18:19:19,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375546746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:19,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:19,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:19:19,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520313098] [2021-12-06 18:19:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:19,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:19:19,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:19:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:19:19,034 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 18:19:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:19,093 INFO L93 Difference]: Finished difference Result 361 states and 558 transitions. [2021-12-06 18:19:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:19:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2021-12-06 18:19:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:19,096 INFO L225 Difference]: With dead ends: 361 [2021-12-06 18:19:19,096 INFO L226 Difference]: Without dead ends: 204 [2021-12-06 18:19:19,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:19:19,098 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 130 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:19,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 1240 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-06 18:19:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-12-06 18:19:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 157 states have (on average 1.484076433121019) internal successors, (233), 161 states have internal predecessors, (233), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:19:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 309 transitions. [2021-12-06 18:19:19,114 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 309 transitions. Word has length 35 [2021-12-06 18:19:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:19,114 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 309 transitions. [2021-12-06 18:19:19,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 18:19:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 309 transitions. [2021-12-06 18:19:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 18:19:19,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:19,116 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:19:19,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:19:19,116 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2059225234, now seen corresponding path program 1 times [2021-12-06 18:19:19,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457056889] [2021-12-06 18:19:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:19,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,166 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:19:19,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:19,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457056889] [2021-12-06 18:19:19,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457056889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201285062] [2021-12-06 18:19:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:19,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:19,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:19,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 18:19:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:19:19,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:19,293 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:19:19,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:19,359 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:19:19,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201285062] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:19:19,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:19:19,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 18:19:19,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311418917] [2021-12-06 18:19:19,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:19:19,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:19,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:19,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:19,362 INFO L87 Difference]: Start difference. First operand 204 states and 309 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:19:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:19,403 INFO L93 Difference]: Finished difference Result 456 states and 705 transitions. [2021-12-06 18:19:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:19,404 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:19:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:19,406 INFO L225 Difference]: With dead ends: 456 [2021-12-06 18:19:19,406 INFO L226 Difference]: Without dead ends: 263 [2021-12-06 18:19:19,407 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:19:19,407 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 98 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:19,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 595 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-06 18:19:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2021-12-06 18:19:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.46) internal successors, (292), 204 states have internal predecessors, (292), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-06 18:19:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2021-12-06 18:19:19,420 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 35 [2021-12-06 18:19:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:19,421 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2021-12-06 18:19:19,421 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:19:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2021-12-06 18:19:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 18:19:19,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:19,422 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:19:19,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 18:19:19,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 18:19:19,624 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 253396334, now seen corresponding path program 2 times [2021-12-06 18:19:19,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047846927] [2021-12-06 18:19:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:19,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,792 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:19:19,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:19,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047846927] [2021-12-06 18:19:19,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047846927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:19,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:19,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:19,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931174780] [2021-12-06 18:19:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:19,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:19,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:19,795 INFO L87 Difference]: Start difference. First operand 257 states and 388 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:19:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:19,831 INFO L93 Difference]: Finished difference Result 494 states and 766 transitions. [2021-12-06 18:19:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:19,831 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:19:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:19,833 INFO L225 Difference]: With dead ends: 494 [2021-12-06 18:19:19,833 INFO L226 Difference]: Without dead ends: 266 [2021-12-06 18:19:19,834 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:19:19,835 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 19 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 834 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:19:19,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 834 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-06 18:19:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2021-12-06 18:19:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 206 states have (on average 1.4563106796116505) internal successors, (300), 210 states have internal predecessors, (300), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-06 18:19:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 396 transitions. [2021-12-06 18:19:19,847 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 396 transitions. Word has length 57 [2021-12-06 18:19:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:19,847 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 396 transitions. [2021-12-06 18:19:19,848 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:19:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 396 transitions. [2021-12-06 18:19:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 18:19:19,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:19,849 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:19:19,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:19:19,849 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:19,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1207102941, now seen corresponding path program 1 times [2021-12-06 18:19:19,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:19,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961504029] [2021-12-06 18:19:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:19,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,894 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:19:19,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:19,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961504029] [2021-12-06 18:19:19,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961504029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:19,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:19,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:19,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996572387] [2021-12-06 18:19:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:19,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:19,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:19,896 INFO L87 Difference]: Start difference. First operand 264 states and 396 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:19:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:19,926 INFO L93 Difference]: Finished difference Result 538 states and 818 transitions. [2021-12-06 18:19:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:19,926 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:19:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:19,928 INFO L225 Difference]: With dead ends: 538 [2021-12-06 18:19:19,928 INFO L226 Difference]: Without dead ends: 303 [2021-12-06 18:19:19,930 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:19:19,931 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 24 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 848 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:19:19,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 848 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-06 18:19:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2021-12-06 18:19:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 238 states have (on average 1.415966386554622) internal successors, (337), 242 states have internal predecessors, (337), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2021-12-06 18:19:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 439 transitions. [2021-12-06 18:19:19,944 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 439 transitions. Word has length 57 [2021-12-06 18:19:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:19,944 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 439 transitions. [2021-12-06 18:19:19,944 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:19:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 439 transitions. [2021-12-06 18:19:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 18:19:19,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:19,945 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:19:19,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:19:19,945 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1632698932, now seen corresponding path program 1 times [2021-12-06 18:19:19,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419394215] [2021-12-06 18:19:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:19,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,003 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:19:20,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419394215] [2021-12-06 18:19:20,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419394215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:20,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570646368] [2021-12-06 18:19:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:20,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:20,005 INFO L87 Difference]: Start difference. First operand 300 states and 439 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:19:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,029 INFO L93 Difference]: Finished difference Result 549 states and 817 transitions. [2021-12-06 18:19:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,029 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:19:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,031 INFO L225 Difference]: With dead ends: 549 [2021-12-06 18:19:20,031 INFO L226 Difference]: Without dead ends: 302 [2021-12-06 18:19:20,032 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:19:20,033 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1131 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:19:20,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-12-06 18:19:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2021-12-06 18:19:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 238 states have (on average 1.403361344537815) internal successors, (334), 242 states have internal predecessors, (334), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2021-12-06 18:19:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 436 transitions. [2021-12-06 18:19:20,045 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 436 transitions. Word has length 75 [2021-12-06 18:19:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,046 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 436 transitions. [2021-12-06 18:19:20,046 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:19:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 436 transitions. [2021-12-06 18:19:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-06 18:19:20,047 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,047 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:19:20,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:19:20,047 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1594312955, now seen corresponding path program 1 times [2021-12-06 18:19:20,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172285124] [2021-12-06 18:19:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,109 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:19:20,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172285124] [2021-12-06 18:19:20,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172285124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:20,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929336338] [2021-12-06 18:19:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:20,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:20,110 INFO L87 Difference]: Start difference. First operand 300 states and 436 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:19:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,142 INFO L93 Difference]: Finished difference Result 586 states and 873 transitions. [2021-12-06 18:19:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,142 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:19:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,144 INFO L225 Difference]: With dead ends: 586 [2021-12-06 18:19:20,144 INFO L226 Difference]: Without dead ends: 344 [2021-12-06 18:19:20,145 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:19:20,146 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 25 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 848 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:19:20,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 848 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-12-06 18:19:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2021-12-06 18:19:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 275 states have (on average 1.3672727272727272) internal successors, (376), 279 states have internal predecessors, (376), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2021-12-06 18:19:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 484 transitions. [2021-12-06 18:19:20,159 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 484 transitions. Word has length 104 [2021-12-06 18:19:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,159 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 484 transitions. [2021-12-06 18:19:20,159 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:19:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 484 transitions. [2021-12-06 18:19:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-06 18:19:20,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,160 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:19:20,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:19:20,160 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash 611529803, now seen corresponding path program 1 times [2021-12-06 18:19:20,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788381669] [2021-12-06 18:19:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,218 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:19:20,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788381669] [2021-12-06 18:19:20,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788381669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:20,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948340116] [2021-12-06 18:19:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:20,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:20,219 INFO L87 Difference]: Start difference. First operand 341 states and 484 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:19:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,250 INFO L93 Difference]: Finished difference Result 612 states and 893 transitions. [2021-12-06 18:19:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:19:20,250 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:19:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,252 INFO L225 Difference]: With dead ends: 612 [2021-12-06 18:19:20,252 INFO L226 Difference]: Without dead ends: 335 [2021-12-06 18:19:20,253 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:19:20,254 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 15 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 807 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:19:20,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 807 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-06 18:19:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2021-12-06 18:19:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 270 states have (on average 1.348148148148148) internal successors, (364), 274 states have internal predecessors, (364), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-12-06 18:19:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 470 transitions. [2021-12-06 18:19:20,266 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 470 transitions. Word has length 105 [2021-12-06 18:19:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,267 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 470 transitions. [2021-12-06 18:19:20,267 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:19:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 470 transitions. [2021-12-06 18:19:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-06 18:19:20,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,268 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:19:20,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:19:20,268 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 435829863, now seen corresponding path program 1 times [2021-12-06 18:19:20,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381754523] [2021-12-06 18:19:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,350 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:19:20,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381754523] [2021-12-06 18:19:20,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381754523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:20,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246752500] [2021-12-06 18:19:20,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:20,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:20,351 INFO L87 Difference]: Start difference. First operand 335 states and 470 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:19:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,373 INFO L93 Difference]: Finished difference Result 587 states and 842 transitions. [2021-12-06 18:19:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,374 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:19:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,376 INFO L225 Difference]: With dead ends: 587 [2021-12-06 18:19:20,376 INFO L226 Difference]: Without dead ends: 337 [2021-12-06 18:19:20,377 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:19:20,378 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1115 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:19:20,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-06 18:19:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-06 18:19:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 270 states have (on average 1.337037037037037) internal successors, (361), 274 states have internal predecessors, (361), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2021-12-06 18:19:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 467 transitions. [2021-12-06 18:19:20,392 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 467 transitions. Word has length 124 [2021-12-06 18:19:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,393 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 467 transitions. [2021-12-06 18:19:20,393 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:19:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 467 transitions. [2021-12-06 18:19:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-06 18:19:20,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,395 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:19:20,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 18:19:20,395 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1733513262, now seen corresponding path program 1 times [2021-12-06 18:19:20,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68989423] [2021-12-06 18:19:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,475 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:19:20,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68989423] [2021-12-06 18:19:20,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68989423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:20,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109863400] [2021-12-06 18:19:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:20,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:20,476 INFO L87 Difference]: Start difference. First operand 335 states and 467 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:19:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,511 INFO L93 Difference]: Finished difference Result 550 states and 802 transitions. [2021-12-06 18:19:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:19:20,511 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:19:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,513 INFO L225 Difference]: With dead ends: 550 [2021-12-06 18:19:20,514 INFO L226 Difference]: Without dead ends: 333 [2021-12-06 18:19:20,514 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:19:20,515 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 13 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 775 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:19:20,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 775 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-12-06 18:19:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2021-12-06 18:19:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 269 states have (on average 1.3345724907063197) internal successors, (359), 273 states have internal predecessors, (359), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-12-06 18:19:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 463 transitions. [2021-12-06 18:19:20,526 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 463 transitions. Word has length 157 [2021-12-06 18:19:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,527 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 463 transitions. [2021-12-06 18:19:20,527 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:19:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 463 transitions. [2021-12-06 18:19:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-12-06 18:19:20,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,529 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, 1, 1, 1, 1] [2021-12-06 18:19:20,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 18:19:20,529 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2146412456, now seen corresponding path program 1 times [2021-12-06 18:19:20,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023566435] [2021-12-06 18:19:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-06 18:19:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,609 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:19:20,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023566435] [2021-12-06 18:19:20,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023566435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:20,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877047173] [2021-12-06 18:19:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:20,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:20,610 INFO L87 Difference]: Start difference. First operand 333 states and 463 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 18:19:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,644 INFO L93 Difference]: Finished difference Result 490 states and 698 transitions. [2021-12-06 18:19:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2021-12-06 18:19:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,647 INFO L225 Difference]: With dead ends: 490 [2021-12-06 18:19:20,647 INFO L226 Difference]: Without dead ends: 316 [2021-12-06 18:19:20,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:20,648 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 35 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 756 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:19:20,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 756 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-06 18:19:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-12-06 18:19:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 259 states have internal predecessors, (338), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-12-06 18:19:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2021-12-06 18:19:20,666 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 176 [2021-12-06 18:19:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,667 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2021-12-06 18:19:20,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 18:19:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2021-12-06 18:19:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-12-06 18:19:20,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,668 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, 1, 1, 1, 1] [2021-12-06 18:19:20,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 18:19:20,669 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1743531092, now seen corresponding path program 1 times [2021-12-06 18:19:20,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983382661] [2021-12-06 18:19:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-06 18:19:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,747 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:19:20,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983382661] [2021-12-06 18:19:20,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983382661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:20,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701829540] [2021-12-06 18:19:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:20,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:20,749 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 18:19:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,785 INFO L93 Difference]: Finished difference Result 473 states and 671 transitions. [2021-12-06 18:19:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2021-12-06 18:19:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,787 INFO L225 Difference]: With dead ends: 473 [2021-12-06 18:19:20,788 INFO L226 Difference]: Without dead ends: 297 [2021-12-06 18:19:20,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:20,789 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 30 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 760 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:19:20,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 760 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-06 18:19:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-12-06 18:19:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 243 states have internal predecessors, (315), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 18:19:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 407 transitions. [2021-12-06 18:19:20,800 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 407 transitions. Word has length 178 [2021-12-06 18:19:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,800 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 407 transitions. [2021-12-06 18:19:20,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 18:19:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 407 transitions. [2021-12-06 18:19:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-12-06 18:19:20,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,802 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, 1, 1, 1, 1] [2021-12-06 18:19:20,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 18:19:20,803 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash -892980879, now seen corresponding path program 1 times [2021-12-06 18:19:20,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338499092] [2021-12-06 18:19:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-06 18:19:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,890 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:19:20,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:20,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338499092] [2021-12-06 18:19:20,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338499092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:20,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:20,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:20,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040179411] [2021-12-06 18:19:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:20,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:20,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:20,892 INFO L87 Difference]: Start difference. First operand 297 states and 407 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 18:19:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:20,909 INFO L93 Difference]: Finished difference Result 453 states and 641 transitions. [2021-12-06 18:19:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2021-12-06 18:19:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:20,911 INFO L225 Difference]: With dead ends: 453 [2021-12-06 18:19:20,911 INFO L226 Difference]: Without dead ends: 297 [2021-12-06 18:19:20,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:19:20,913 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1093 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:19:20,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1093 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-06 18:19:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-12-06 18:19:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 239 states have (on average 1.292887029288703) internal successors, (309), 243 states have internal predecessors, (309), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 18:19:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 401 transitions. [2021-12-06 18:19:20,923 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 401 transitions. Word has length 179 [2021-12-06 18:19:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:20,924 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 401 transitions. [2021-12-06 18:19:20,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 18:19:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 401 transitions. [2021-12-06 18:19:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-06 18:19:20,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:20,926 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, 1, 1, 1, 1] [2021-12-06 18:19:20,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 18:19:20,926 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2002114655, now seen corresponding path program 1 times [2021-12-06 18:19:20,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:20,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726350123] [2021-12-06 18:19:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:20,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-06 18:19:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,010 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:19:21,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:21,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726350123] [2021-12-06 18:19:21,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726350123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:21,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922522412] [2021-12-06 18:19:21,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:21,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:21,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:21,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 18:19:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:21,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:21,304 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:19:21,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:21,484 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:19:21,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922522412] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:21,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 18:19:21,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-12-06 18:19:21,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140828572] [2021-12-06 18:19:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:21,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:21,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:21,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:21,486 INFO L87 Difference]: Start difference. First operand 297 states and 401 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:19:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:21,519 INFO L93 Difference]: Finished difference Result 474 states and 663 transitions. [2021-12-06 18:19:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:19:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2021-12-06 18:19:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:21,522 INFO L225 Difference]: With dead ends: 474 [2021-12-06 18:19:21,522 INFO L226 Difference]: Without dead ends: 276 [2021-12-06 18:19:21,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 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:19:21,524 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 35 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 519 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:19:21,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 519 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-06 18:19:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-12-06 18:19:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 225 states have internal predecessors, (284), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-06 18:19:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 370 transitions. [2021-12-06 18:19:21,537 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 370 transitions. Word has length 186 [2021-12-06 18:19:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:21,538 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 370 transitions. [2021-12-06 18:19:21,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:19:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 370 transitions. [2021-12-06 18:19:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-12-06 18:19:21,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:21,541 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, 1, 1, 1, 1] [2021-12-06 18:19:21,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 18:19:21,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 18:19:21,742 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1523071826, now seen corresponding path program 1 times [2021-12-06 18:19:21,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:21,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482448990] [2021-12-06 18:19:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:21,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,837 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:19:21,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482448990] [2021-12-06 18:19:21,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482448990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:21,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:21,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:21,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615236411] [2021-12-06 18:19:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:21,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:21,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:21,840 INFO L87 Difference]: Start difference. First operand 276 states and 370 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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:19:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:21,870 INFO L93 Difference]: Finished difference Result 431 states and 604 transitions. [2021-12-06 18:19:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 210 [2021-12-06 18:19:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:21,873 INFO L225 Difference]: With dead ends: 431 [2021-12-06 18:19:21,873 INFO L226 Difference]: Without dead ends: 282 [2021-12-06 18:19:21,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:19:21,874 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 6 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 800 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:19:21,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 800 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-06 18:19:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2021-12-06 18:19:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 224 states have (on average 1.28125) internal successors, (287), 228 states have internal predecessors, (287), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-06 18:19:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2021-12-06 18:19:21,888 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 210 [2021-12-06 18:19:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:21,889 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2021-12-06 18:19:21,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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:19:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2021-12-06 18:19:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-12-06 18:19:21,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:21,892 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, 1, 1, 1, 1] [2021-12-06 18:19:21,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 18:19:21,893 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 45888737, now seen corresponding path program 1 times [2021-12-06 18:19:21,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:21,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085140444] [2021-12-06 18:19:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:21,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,016 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:19:22,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:22,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085140444] [2021-12-06 18:19:22,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085140444] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:22,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627347013] [2021-12-06 18:19:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:22,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:22,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:22,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 18:19:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:22,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:22,281 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:19:22,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:22,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627347013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:22,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:22,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:22,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57857474] [2021-12-06 18:19:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:22,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:22,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:22,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:22,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:22,282 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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:19:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:22,303 INFO L93 Difference]: Finished difference Result 440 states and 611 transitions. [2021-12-06 18:19:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 219 [2021-12-06 18:19:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:22,306 INFO L225 Difference]: With dead ends: 440 [2021-12-06 18:19:22,306 INFO L226 Difference]: Without dead ends: 287 [2021-12-06 18:19:22,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 256 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:19:22,307 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 7 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 805 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:19:22,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 805 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-06 18:19:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-12-06 18:19:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 228 states have (on average 1.2763157894736843) internal successors, (291), 232 states have internal predecessors, (291), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-06 18:19:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2021-12-06 18:19:22,316 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 219 [2021-12-06 18:19:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:22,316 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2021-12-06 18:19:22,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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:19:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2021-12-06 18:19:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-06 18:19:22,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:22,319 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, 1, 1, 1, 1] [2021-12-06 18:19:22,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 18:19:22,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:22,519 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1724470702, now seen corresponding path program 1 times [2021-12-06 18:19:22,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:22,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815438698] [2021-12-06 18:19:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:22,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,627 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:19:22,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:22,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815438698] [2021-12-06 18:19:22,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815438698] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:22,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534968821] [2021-12-06 18:19:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:22,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:22,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:22,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 18:19:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:22,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:22,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:22,886 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:19:22,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:22,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534968821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:22,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:22,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:22,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863957308] [2021-12-06 18:19:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:22,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:22,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:22,887 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-06 18:19:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:22,908 INFO L93 Difference]: Finished difference Result 442 states and 609 transitions. [2021-12-06 18:19:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:19:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 229 [2021-12-06 18:19:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:22,910 INFO L225 Difference]: With dead ends: 442 [2021-12-06 18:19:22,910 INFO L226 Difference]: Without dead ends: 284 [2021-12-06 18:19:22,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 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:19:22,911 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 7 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 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:19:22,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-06 18:19:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-12-06 18:19:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.263157894736842) internal successors, (288), 231 states have internal predecessors, (288), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2021-12-06 18:19:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 372 transitions. [2021-12-06 18:19:22,920 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 372 transitions. Word has length 229 [2021-12-06 18:19:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:22,921 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 372 transitions. [2021-12-06 18:19:22,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-06 18:19:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 372 transitions. [2021-12-06 18:19:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-12-06 18:19:22,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:22,923 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, 1, 1] [2021-12-06 18:19:22,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 18:19:23,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:23,124 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash -88373812, now seen corresponding path program 1 times [2021-12-06 18:19:23,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24017053] [2021-12-06 18:19:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:23,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,255 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:19:23,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:23,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24017053] [2021-12-06 18:19:23,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24017053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:23,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:23,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:23,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815713215] [2021-12-06 18:19:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:23,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:23,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:23,257 INFO L87 Difference]: Start difference. First operand 284 states and 372 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-12-06 18:19:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:23,425 INFO L93 Difference]: Finished difference Result 484 states and 672 transitions. [2021-12-06 18:19:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:19:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 238 [2021-12-06 18:19:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:23,428 INFO L225 Difference]: With dead ends: 484 [2021-12-06 18:19:23,428 INFO L226 Difference]: Without dead ends: 327 [2021-12-06 18:19:23,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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:19:23,429 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 183 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:23,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 652 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:19:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-06 18:19:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 283. [2021-12-06 18:19:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.2587719298245614) internal successors, (287), 230 states have internal predecessors, (287), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 18:19:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 369 transitions. [2021-12-06 18:19:23,443 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 369 transitions. Word has length 238 [2021-12-06 18:19:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:23,444 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 369 transitions. [2021-12-06 18:19:23,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-12-06 18:19:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 369 transitions. [2021-12-06 18:19:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-12-06 18:19:23,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:23,445 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, 1, 1, 1, 1, 1] [2021-12-06 18:19:23,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 18:19:23,446 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash -284812756, now seen corresponding path program 1 times [2021-12-06 18:19:23,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:23,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837875885] [2021-12-06 18:19:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:23,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:23,591 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:19:23,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837875885] [2021-12-06 18:19:23,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837875885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:23,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:23,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:23,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932492581] [2021-12-06 18:19:23,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:23,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:23,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:23,594 INFO L87 Difference]: Start difference. First operand 283 states and 369 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 18:19:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:23,960 INFO L93 Difference]: Finished difference Result 670 states and 903 transitions. [2021-12-06 18:19:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:19:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 241 [2021-12-06 18:19:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:23,964 INFO L225 Difference]: With dead ends: 670 [2021-12-06 18:19:23,964 INFO L226 Difference]: Without dead ends: 514 [2021-12-06 18:19:23,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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:19:23,966 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 433 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:23,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 873 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:19:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-12-06 18:19:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 505. [2021-12-06 18:19:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 403 states have (on average 1.3101736972704714) internal successors, (528), 405 states have internal predecessors, (528), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2021-12-06 18:19:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 668 transitions. [2021-12-06 18:19:23,990 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 668 transitions. Word has length 241 [2021-12-06 18:19:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:23,990 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 668 transitions. [2021-12-06 18:19:23,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 18:19:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 668 transitions. [2021-12-06 18:19:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-12-06 18:19:23,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:23,992 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, 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:19:23,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 18:19:23,992 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash -571150504, now seen corresponding path program 1 times [2021-12-06 18:19:23,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:23,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831815740] [2021-12-06 18:19:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:23,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:19:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-06 18:19:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:19:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:19:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-12-06 18:19:24,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:24,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831815740] [2021-12-06 18:19:24,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831815740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:24,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:24,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:24,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999549794] [2021-12-06 18:19:24,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:24,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:24,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:24,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:24,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:24,107 INFO L87 Difference]: Start difference. First operand 505 states and 668 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 18:19:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:24,397 INFO L93 Difference]: Finished difference Result 1106 states and 1514 transitions. [2021-12-06 18:19:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:24,397 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 272 [2021-12-06 18:19:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:24,402 INFO L225 Difference]: With dead ends: 1106 [2021-12-06 18:19:24,402 INFO L226 Difference]: Without dead ends: 809 [2021-12-06 18:19:24,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:19:24,403 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 222 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:24,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 628 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:19:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-06 18:19:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 640. [2021-12-06 18:19:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 513 states have (on average 1.3177387914230019) internal successors, (676), 519 states have internal predecessors, (676), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2021-12-06 18:19:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 846 transitions. [2021-12-06 18:19:24,439 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 846 transitions. Word has length 272 [2021-12-06 18:19:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:24,439 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 846 transitions. [2021-12-06 18:19:24,439 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 18:19:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 846 transitions. [2021-12-06 18:19:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-12-06 18:19:24,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:24,441 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, 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:19:24,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 18:19:24,441 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1395588113, now seen corresponding path program 1 times [2021-12-06 18:19:24,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:24,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22002286] [2021-12-06 18:19:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:24,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:19:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:19:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 18:19:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:19:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-12-06 18:19:24,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22002286] [2021-12-06 18:19:24,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22002286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:24,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:24,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:24,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995173561] [2021-12-06 18:19:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:24,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:24,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:24,550 INFO L87 Difference]: Start difference. First operand 640 states and 846 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 18:19:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:24,843 INFO L93 Difference]: Finished difference Result 1410 states and 1914 transitions. [2021-12-06 18:19:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:24,843 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 273 [2021-12-06 18:19:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:24,848 INFO L225 Difference]: With dead ends: 1410 [2021-12-06 18:19:24,848 INFO L226 Difference]: Without dead ends: 1017 [2021-12-06 18:19:24,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:19:24,850 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 225 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:24,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 661 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:19:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-06 18:19:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1003. [2021-12-06 18:19:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 796 states have (on average 1.342964824120603) internal successors, (1069), 810 states have internal predecessors, (1069), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2021-12-06 18:19:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1347 transitions. [2021-12-06 18:19:24,891 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1347 transitions. Word has length 273 [2021-12-06 18:19:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:24,891 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1347 transitions. [2021-12-06 18:19:24,891 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, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-06 18:19:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1347 transitions. [2021-12-06 18:19:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-12-06 18:19:24,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:24,894 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, 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] [2021-12-06 18:19:24,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 18:19:24,894 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -898457517, now seen corresponding path program 1 times [2021-12-06 18:19:24,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822896569] [2021-12-06 18:19:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:24,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-06 18:19:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:19:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-12-06 18:19:25,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:25,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822896569] [2021-12-06 18:19:25,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822896569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:25,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:25,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:19:25,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253071629] [2021-12-06 18:19:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:25,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:25,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:19:25,007 INFO L87 Difference]: Start difference. First operand 1003 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 18:19:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:25,314 INFO L93 Difference]: Finished difference Result 2319 states and 3189 transitions. [2021-12-06 18:19:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 274 [2021-12-06 18:19:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:25,325 INFO L225 Difference]: With dead ends: 2319 [2021-12-06 18:19:25,325 INFO L226 Difference]: Without dead ends: 1609 [2021-12-06 18:19:25,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:19:25,328 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 227 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:25,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 693 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:19:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2021-12-06 18:19:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1583. [2021-12-06 18:19:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1244 states have (on average 1.367363344051447) internal successors, (1701), 1272 states have internal predecessors, (1701), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2021-12-06 18:19:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2163 transitions. [2021-12-06 18:19:25,406 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2163 transitions. Word has length 274 [2021-12-06 18:19:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:25,406 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 2163 transitions. [2021-12-06 18:19:25,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 18:19:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2163 transitions. [2021-12-06 18:19:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-12-06 18:19:25,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:25,408 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, 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] [2021-12-06 18:19:25,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 18:19:25,409 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1292824303, now seen corresponding path program 1 times [2021-12-06 18:19:25,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:25,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859592712] [2021-12-06 18:19:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:25,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-06 18:19:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:19:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-06 18:19:25,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859592712] [2021-12-06 18:19:25,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859592712] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263089066] [2021-12-06 18:19:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:25,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:25,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:25,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 18:19:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:25,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:19:25,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-12-06 18:19:25,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:25,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263089066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:25,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:25,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-06 18:19:25,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320780694] [2021-12-06 18:19:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:25,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:25,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:25,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:25,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:19:25,872 INFO L87 Difference]: Start difference. First operand 1583 states and 2163 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, (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:19:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:25,954 INFO L93 Difference]: Finished difference Result 2913 states and 4038 transitions. [2021-12-06 18:19:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:25,954 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, (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 274 [2021-12-06 18:19:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:25,961 INFO L225 Difference]: With dead ends: 2913 [2021-12-06 18:19:25,962 INFO L226 Difference]: Without dead ends: 1583 [2021-12-06 18:19:25,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 321 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:19:25,965 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 51 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 708 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:19:25,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 708 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2021-12-06 18:19:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2021-12-06 18:19:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1244 states have (on average 1.3480707395498392) internal successors, (1677), 1272 states have internal predecessors, (1677), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2021-12-06 18:19:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2139 transitions. [2021-12-06 18:19:26,023 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2139 transitions. Word has length 274 [2021-12-06 18:19:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:26,024 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 2139 transitions. [2021-12-06 18:19:26,024 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, (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:19:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2139 transitions. [2021-12-06 18:19:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-12-06 18:19:26,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:26,026 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, 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] [2021-12-06 18:19:26,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 18:19:26,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 18:19:26,227 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -78372800, now seen corresponding path program 1 times [2021-12-06 18:19:26,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397188239] [2021-12-06 18:19:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:26,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-06 18:19:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2021-12-06 18:19:26,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:26,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397188239] [2021-12-06 18:19:26,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397188239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:26,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774562253] [2021-12-06 18:19:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:26,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:26,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:26,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 18:19:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:26,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:19:26,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2021-12-06 18:19:26,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:26,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774562253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:26,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:26,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-06 18:19:26,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869652219] [2021-12-06 18:19:26,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:26,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:26,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:19:26,695 INFO L87 Difference]: Start difference. First operand 1583 states and 2139 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, (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:19:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:26,781 INFO L93 Difference]: Finished difference Result 2913 states and 3982 transitions. [2021-12-06 18:19:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:26,781 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, (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 275 [2021-12-06 18:19:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:26,793 INFO L225 Difference]: With dead ends: 2913 [2021-12-06 18:19:26,793 INFO L226 Difference]: Without dead ends: 1631 [2021-12-06 18:19:26,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 322 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:19:26,797 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 15 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 731 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:19:26,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 731 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-12-06 18:19:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-12-06 18:19:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1284 states have (on average 1.3496884735202492) internal successors, (1733), 1312 states have internal predecessors, (1733), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2021-12-06 18:19:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2195 transitions. [2021-12-06 18:19:26,875 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2195 transitions. Word has length 275 [2021-12-06 18:19:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:26,876 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2195 transitions. [2021-12-06 18:19:26,876 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, (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:19:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2195 transitions. [2021-12-06 18:19:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-06 18:19:26,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:26,878 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, 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:19:26,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 18:19:27,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 18:19:27,079 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 524917483, now seen corresponding path program 1 times [2021-12-06 18:19:27,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:27,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529245149] [2021-12-06 18:19:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:27,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2021-12-06 18:19:27,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529245149] [2021-12-06 18:19:27,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529245149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729301898] [2021-12-06 18:19:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:27,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:27,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:27,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 18:19:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:27,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 18:19:27,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-12-06 18:19:27,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:27,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729301898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:27,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:27,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2021-12-06 18:19:27,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541088566] [2021-12-06 18:19:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:27,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:19:27,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:19:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-06 18:19:27,594 INFO L87 Difference]: Start difference. First operand 1631 states and 2195 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-06 18:19:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:27,749 INFO L93 Difference]: Finished difference Result 2497 states and 3590 transitions. [2021-12-06 18:19:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:19:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 276 [2021-12-06 18:19:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:27,761 INFO L225 Difference]: With dead ends: 2497 [2021-12-06 18:19:27,761 INFO L226 Difference]: Without dead ends: 2495 [2021-12-06 18:19:27,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-06 18:19:27,763 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 193 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:27,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1844 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2021-12-06 18:19:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1679. [2021-12-06 18:19:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1316 states have (on average 1.3411854103343466) internal successors, (1765), 1352 states have internal predecessors, (1765), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2021-12-06 18:19:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2243 transitions. [2021-12-06 18:19:27,863 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2243 transitions. Word has length 276 [2021-12-06 18:19:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:27,863 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2243 transitions. [2021-12-06 18:19:27,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-06 18:19:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2243 transitions. [2021-12-06 18:19:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-12-06 18:19:27,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:27,866 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, 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] [2021-12-06 18:19:27,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 18:19:28,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 18:19:28,067 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1725038329, now seen corresponding path program 1 times [2021-12-06 18:19:28,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:28,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944354615] [2021-12-06 18:19:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:28,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:19:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-12-06 18:19:28,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:28,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944354615] [2021-12-06 18:19:28,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944354615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:28,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62360294] [2021-12-06 18:19:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:28,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:28,237 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:28,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 18:19:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:28,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 18:19:28,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-06 18:19:28,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-12-06 18:19:28,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62360294] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:19:28,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:19:28,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-12-06 18:19:28,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706645492] [2021-12-06 18:19:28,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:19:28,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 18:19:28,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 18:19:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:19:28,950 INFO L87 Difference]: Start difference. First operand 1679 states and 2243 transitions. Second operand has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 14 states have internal predecessors, (157), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2021-12-06 18:19:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:30,205 INFO L93 Difference]: Finished difference Result 4922 states and 7094 transitions. [2021-12-06 18:19:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 18:19:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 14 states have internal predecessors, (157), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 284 [2021-12-06 18:19:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:30,224 INFO L225 Difference]: With dead ends: 4922 [2021-12-06 18:19:30,224 INFO L226 Difference]: Without dead ends: 3544 [2021-12-06 18:19:30,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 618 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:19:30,228 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 720 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 4031 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:30,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [777 Valid, 4031 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 18:19:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2021-12-06 18:19:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 2498. [2021-12-06 18:19:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 1952 states have (on average 1.3288934426229508) internal successors, (2594), 2004 states have internal predecessors, (2594), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2021-12-06 18:19:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3314 transitions. [2021-12-06 18:19:30,360 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3314 transitions. Word has length 284 [2021-12-06 18:19:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:30,360 INFO L470 AbstractCegarLoop]: Abstraction has 2498 states and 3314 transitions. [2021-12-06 18:19:30,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 14 states have internal predecessors, (157), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2021-12-06 18:19:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3314 transitions. [2021-12-06 18:19:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-12-06 18:19:30,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:30,364 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, 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] [2021-12-06 18:19:30,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 18:19:30,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 18:19:30,565 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -763424312, now seen corresponding path program 1 times [2021-12-06 18:19:30,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:30,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849769205] [2021-12-06 18:19:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:30,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:19:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-12-06 18:19:30,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849769205] [2021-12-06 18:19:30,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849769205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226056588] [2021-12-06 18:19:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:30,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:30,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:30,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 18:19:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:30,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2021-12-06 18:19:30,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:30,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226056588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:30,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:30,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:30,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733376481] [2021-12-06 18:19:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:30,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:30,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:30,979 INFO L87 Difference]: Start difference. First operand 2498 states and 3314 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-06 18:19:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:31,122 INFO L93 Difference]: Finished difference Result 4829 states and 6504 transitions. [2021-12-06 18:19:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:31,122 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 284 [2021-12-06 18:19:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:31,137 INFO L225 Difference]: With dead ends: 4829 [2021-12-06 18:19:31,137 INFO L226 Difference]: Without dead ends: 2434 [2021-12-06 18:19:31,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 334 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:19:31,142 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 11 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 731 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:19:31,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 731 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-12-06 18:19:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-12-06 18:19:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1908 states have (on average 1.3123689727463312) internal successors, (2504), 1960 states have internal predecessors, (2504), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2021-12-06 18:19:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3188 transitions. [2021-12-06 18:19:31,240 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3188 transitions. Word has length 284 [2021-12-06 18:19:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:31,240 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 3188 transitions. [2021-12-06 18:19:31,240 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, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-06 18:19:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3188 transitions. [2021-12-06 18:19:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-12-06 18:19:31,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:31,244 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, 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] [2021-12-06 18:19:31,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 18:19:31,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:31,445 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -455145673, now seen corresponding path program 1 times [2021-12-06 18:19:31,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468839574] [2021-12-06 18:19:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:31,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 18:19:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 18:19:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:19:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-06 18:19:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-06 18:19:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-12-06 18:19:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-06 18:19:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:19:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:19:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:19:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-12-06 18:19:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2021-12-06 18:19:31,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468839574] [2021-12-06 18:19:31,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468839574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489563309] [2021-12-06 18:19:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:31,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:31,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:31,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 18:19:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:31,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:31,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2021-12-06 18:19:31,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:31,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489563309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:31,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:31,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:31,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249264711] [2021-12-06 18:19:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:31,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:31,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:31,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:31,898 INFO L87 Difference]: Start difference. First operand 2434 states and 3188 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-06 18:19:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:31,996 INFO L93 Difference]: Finished difference Result 4590 states and 6117 transitions. [2021-12-06 18:19:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:31,996 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 287 [2021-12-06 18:19:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:32,010 INFO L225 Difference]: With dead ends: 4590 [2021-12-06 18:19:32,010 INFO L226 Difference]: Without dead ends: 2241 [2021-12-06 18:19:32,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 337 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:19:32,015 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 8 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 734 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:19:32,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 734 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2021-12-06 18:19:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2021-12-06 18:19:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1745 states have (on average 1.3060171919770773) internal successors, (2279), 1797 states have internal predecessors, (2279), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2021-12-06 18:19:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 2925 transitions. [2021-12-06 18:19:32,133 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 2925 transitions. Word has length 287 [2021-12-06 18:19:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:32,133 INFO L470 AbstractCegarLoop]: Abstraction has 2241 states and 2925 transitions. [2021-12-06 18:19:32,133 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-06 18:19:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2925 transitions. [2021-12-06 18:19:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-12-06 18:19:32,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:32,137 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:32,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 18:19:32,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 18:19:32,338 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1145505540, now seen corresponding path program 1 times [2021-12-06 18:19:32,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:32,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525280705] [2021-12-06 18:19:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:32,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:19:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:19:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:19:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2021-12-06 18:19:32,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:32,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525280705] [2021-12-06 18:19:32,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525280705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:32,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627473920] [2021-12-06 18:19:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:32,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:32,524 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:32,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 18:19:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:32,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:19:32,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-06 18:19:32,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:32,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627473920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:32,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:32,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-12-06 18:19:32,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885680965] [2021-12-06 18:19:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:32,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:19:32,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:19:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:19:32,917 INFO L87 Difference]: Start difference. First operand 2241 states and 2925 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:33,558 INFO L93 Difference]: Finished difference Result 5689 states and 7647 transitions. [2021-12-06 18:19:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:19:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 299 [2021-12-06 18:19:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:33,576 INFO L225 Difference]: With dead ends: 5689 [2021-12-06 18:19:33,576 INFO L226 Difference]: Without dead ends: 4047 [2021-12-06 18:19:33,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 346 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:19:33,580 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 1145 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3446 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:33,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 3446 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 18:19:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2021-12-06 18:19:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3311. [2021-12-06 18:19:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 2564 states have (on average 1.3014820592823713) internal successors, (3337), 2644 states have internal predecessors, (3337), 479 states have call successors, (479), 267 states have call predecessors, (479), 267 states have return successors, (479), 407 states have call predecessors, (479), 479 states have call successors, (479) [2021-12-06 18:19:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4295 transitions. [2021-12-06 18:19:33,731 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4295 transitions. Word has length 299 [2021-12-06 18:19:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:33,732 INFO L470 AbstractCegarLoop]: Abstraction has 3311 states and 4295 transitions. [2021-12-06 18:19:33,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4295 transitions. [2021-12-06 18:19:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-12-06 18:19:33,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:33,735 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:33,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 18:19:33,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:33,935 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1176765881, now seen corresponding path program 1 times [2021-12-06 18:19:33,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:33,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363436351] [2021-12-06 18:19:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:33,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:19:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-06 18:19:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-06 18:19:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:19:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2021-12-06 18:19:34,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363436351] [2021-12-06 18:19:34,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363436351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:34,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:34,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:19:34,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855342204] [2021-12-06 18:19:34,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:34,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:19:34,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:19:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:19:34,047 INFO L87 Difference]: Start difference. First operand 3311 states and 4295 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:34,611 INFO L93 Difference]: Finished difference Result 10355 states and 14945 transitions. [2021-12-06 18:19:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:19:34,612 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 305 [2021-12-06 18:19:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:34,638 INFO L225 Difference]: With dead ends: 10355 [2021-12-06 18:19:34,638 INFO L226 Difference]: Without dead ends: 7571 [2021-12-06 18:19:34,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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:19:34,645 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 529 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:34,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 2025 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:19:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2021-12-06 18:19:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 3567. [2021-12-06 18:19:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3567 states, 2772 states have (on average 1.3134920634920635) internal successors, (3641), 2852 states have internal predecessors, (3641), 527 states have call successors, (527), 267 states have call predecessors, (527), 267 states have return successors, (527), 455 states have call predecessors, (527), 527 states have call successors, (527) [2021-12-06 18:19:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4695 transitions. [2021-12-06 18:19:34,870 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4695 transitions. Word has length 305 [2021-12-06 18:19:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:34,871 INFO L470 AbstractCegarLoop]: Abstraction has 3567 states and 4695 transitions. [2021-12-06 18:19:34,871 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, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4695 transitions. [2021-12-06 18:19:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-12-06 18:19:34,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:34,874 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:34,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-06 18:19:34,875 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -653649099, now seen corresponding path program 1 times [2021-12-06 18:19:34,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:34,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535780469] [2021-12-06 18:19:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:34,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:34,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:19:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-06 18:19:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-06 18:19:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:19:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2021-12-06 18:19:35,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:35,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535780469] [2021-12-06 18:19:35,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535780469] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:35,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604623463] [2021-12-06 18:19:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:35,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:35,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:35,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 18:19:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:35,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:19:35,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-12-06 18:19:35,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:35,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604623463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:35,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:35,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-12-06 18:19:35,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837357416] [2021-12-06 18:19:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:35,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:19:35,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:19:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:19:35,484 INFO L87 Difference]: Start difference. First operand 3567 states and 4695 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:36,451 INFO L93 Difference]: Finished difference Result 7819 states and 10685 transitions. [2021-12-06 18:19:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:19:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 305 [2021-12-06 18:19:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:36,463 INFO L225 Difference]: With dead ends: 7819 [2021-12-06 18:19:36,463 INFO L226 Difference]: Without dead ends: 4783 [2021-12-06 18:19:36,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 355 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:19:36,468 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 1248 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:36,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 3782 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 18:19:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2021-12-06 18:19:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 3499. [2021-12-06 18:19:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2716 states have (on average 1.3022827687776142) internal successors, (3537), 2796 states have internal predecessors, (3537), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2021-12-06 18:19:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4567 transitions. [2021-12-06 18:19:36,672 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4567 transitions. Word has length 305 [2021-12-06 18:19:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:36,672 INFO L470 AbstractCegarLoop]: Abstraction has 3499 states and 4567 transitions. [2021-12-06 18:19:36,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-06 18:19:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4567 transitions. [2021-12-06 18:19:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-12-06 18:19:36,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:36,675 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:19:36,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 18:19:36,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:36,875 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 233405749, now seen corresponding path program 1 times [2021-12-06 18:19:36,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273562024] [2021-12-06 18:19:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:36,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:19:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-06 18:19:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-06 18:19:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:19:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2021-12-06 18:19:37,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:37,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273562024] [2021-12-06 18:19:37,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273562024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:37,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117330412] [2021-12-06 18:19:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:37,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:37,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:37,023 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:37,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 18:19:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:37,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:19:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-06 18:19:37,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:37,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117330412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:37,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:37,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-12-06 18:19:37,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802966667] [2021-12-06 18:19:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:37,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:19:37,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:19:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-12-06 18:19:37,430 INFO L87 Difference]: Start difference. First operand 3499 states and 4567 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:19:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:38,478 INFO L93 Difference]: Finished difference Result 12781 states and 17508 transitions. [2021-12-06 18:19:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:19:38,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 305 [2021-12-06 18:19:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:38,501 INFO L225 Difference]: With dead ends: 12781 [2021-12-06 18:19:38,501 INFO L226 Difference]: Without dead ends: 9825 [2021-12-06 18:19:38,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 18:19:38,507 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 1347 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 3785 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:38,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 3785 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 18:19:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9825 states. [2021-12-06 18:19:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9825 to 5641. [2021-12-06 18:19:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 4358 states have (on average 1.2987608994951814) internal successors, (5660), 4482 states have internal predecessors, (5660), 855 states have call successors, (855), 427 states have call predecessors, (855), 427 states have return successors, (855), 739 states have call predecessors, (855), 855 states have call successors, (855) [2021-12-06 18:19:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7370 transitions. [2021-12-06 18:19:38,871 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7370 transitions. Word has length 305 [2021-12-06 18:19:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:38,871 INFO L470 AbstractCegarLoop]: Abstraction has 5641 states and 7370 transitions. [2021-12-06 18:19:38,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:19:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7370 transitions. [2021-12-06 18:19:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2021-12-06 18:19:38,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:38,874 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, 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] [2021-12-06 18:19:38,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 18:19:39,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 18:19:39,074 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2061720331, now seen corresponding path program 1 times [2021-12-06 18:19:39,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:39,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485018337] [2021-12-06 18:19:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:39,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:19:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:19:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:19:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:19:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2021-12-06 18:19:39,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:39,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485018337] [2021-12-06 18:19:39,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485018337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:39,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:39,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:19:39,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560280199] [2021-12-06 18:19:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:39,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:39,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:39,171 INFO L87 Difference]: Start difference. First operand 5641 states and 7370 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-06 18:19:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:39,724 INFO L93 Difference]: Finished difference Result 9549 states and 12531 transitions. [2021-12-06 18:19:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:19:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 318 [2021-12-06 18:19:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:39,736 INFO L225 Difference]: With dead ends: 9549 [2021-12-06 18:19:39,736 INFO L226 Difference]: Without dead ends: 4743 [2021-12-06 18:19:39,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:19:39,744 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 373 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:39,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 1234 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:19:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2021-12-06 18:19:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 4691. [2021-12-06 18:19:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4691 states, 3632 states have (on average 1.28386563876652) internal successors, (4663), 3732 states have internal predecessors, (4663), 707 states have call successors, (707), 351 states have call predecessors, (707), 351 states have return successors, (707), 607 states have call predecessors, (707), 707 states have call successors, (707) [2021-12-06 18:19:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 6077 transitions. [2021-12-06 18:19:40,063 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 6077 transitions. Word has length 318 [2021-12-06 18:19:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:40,064 INFO L470 AbstractCegarLoop]: Abstraction has 4691 states and 6077 transitions. [2021-12-06 18:19:40,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-06 18:19:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 6077 transitions. [2021-12-06 18:19:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-06 18:19:40,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:40,069 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, 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:19:40,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 18:19:40,069 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash 192449224, now seen corresponding path program 1 times [2021-12-06 18:19:40,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901679223] [2021-12-06 18:19:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:40,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:19:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:19:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:19:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:19:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:19:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:19:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:19:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:19:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:19:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 46 proven. 186 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2021-12-06 18:19:40,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901679223] [2021-12-06 18:19:40,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901679223] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:40,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036940338] [2021-12-06 18:19:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:40,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:40,384 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:40,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 18:19:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:40,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 18:19:40,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-12-06 18:19:40,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2021-12-06 18:19:41,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036940338] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:19:41,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:19:41,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 25 [2021-12-06 18:19:41,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409176097] [2021-12-06 18:19:41,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:19:41,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 18:19:41,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 18:19:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-12-06 18:19:41,166 INFO L87 Difference]: Start difference. First operand 4691 states and 6077 transitions. Second operand has 25 states, 25 states have (on average 8.88) internal successors, (222), 19 states have internal predecessors, (222), 6 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (52), 10 states have call predecessors, (52), 6 states have call successors, (52) [2021-12-06 18:19:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:44,371 INFO L93 Difference]: Finished difference Result 18549 states and 25208 transitions. [2021-12-06 18:19:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-06 18:19:44,372 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.88) internal successors, (222), 19 states have internal predecessors, (222), 6 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (52), 10 states have call predecessors, (52), 6 states have call successors, (52) Word has length 361 [2021-12-06 18:19:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:44,406 INFO L225 Difference]: With dead ends: 18549 [2021-12-06 18:19:44,406 INFO L226 Difference]: Without dead ends: 14385 [2021-12-06 18:19:44,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 785 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=2346, Unknown=0, NotChecked=0, Total=2652 [2021-12-06 18:19:44,415 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 1394 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 8771 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:44,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 8771 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 4398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-06 18:19:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14385 states. [2021-12-06 18:19:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14385 to 8141. [2021-12-06 18:19:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8141 states, 6263 states have (on average 1.2725530895736867) internal successors, (7970), 6411 states have internal predecessors, (7970), 1240 states have call successors, (1240), 587 states have call predecessors, (1240), 637 states have return successors, (1312), 1142 states have call predecessors, (1312), 1240 states have call successors, (1312) [2021-12-06 18:19:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8141 states to 8141 states and 10522 transitions. [2021-12-06 18:19:44,939 INFO L78 Accepts]: Start accepts. Automaton has 8141 states and 10522 transitions. Word has length 361 [2021-12-06 18:19:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:44,940 INFO L470 AbstractCegarLoop]: Abstraction has 8141 states and 10522 transitions. [2021-12-06 18:19:44,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.88) internal successors, (222), 19 states have internal predecessors, (222), 6 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (52), 10 states have call predecessors, (52), 6 states have call successors, (52) [2021-12-06 18:19:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8141 states and 10522 transitions. [2021-12-06 18:19:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-06 18:19:44,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:44,948 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 18:19:45,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-06 18:19:45,149 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1287975448, now seen corresponding path program 1 times [2021-12-06 18:19:45,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:45,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871884277] [2021-12-06 18:19:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:45,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-06 18:19:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:19:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:19:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:19:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:19:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:19:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:19:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:19:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:19:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:19:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 58 proven. 10 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2021-12-06 18:19:45,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871884277] [2021-12-06 18:19:45,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871884277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358898038] [2021-12-06 18:19:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:45,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:45,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:45,274 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:45,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 18:19:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:45,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:45,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2021-12-06 18:19:45,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:45,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358898038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:45,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:45,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:45,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479710860] [2021-12-06 18:19:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:45,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:45,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:45,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:45,628 INFO L87 Difference]: Start difference. First operand 8141 states and 10522 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-06 18:19:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:45,979 INFO L93 Difference]: Finished difference Result 14869 states and 19033 transitions. [2021-12-06 18:19:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 361 [2021-12-06 18:19:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:45,997 INFO L225 Difference]: With dead ends: 14869 [2021-12-06 18:19:45,997 INFO L226 Difference]: Without dead ends: 6405 [2021-12-06 18:19:46,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 427 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:19:46,009 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 40 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:46,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 690 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2021-12-06 18:19:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6405. [2021-12-06 18:19:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6405 states, 4967 states have (on average 1.2273001811958928) internal successors, (6096), 5091 states have internal predecessors, (6096), 928 states have call successors, (928), 507 states have call predecessors, (928), 509 states have return successors, (932), 806 states have call predecessors, (932), 928 states have call successors, (932) [2021-12-06 18:19:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 7956 transitions. [2021-12-06 18:19:46,383 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 7956 transitions. Word has length 361 [2021-12-06 18:19:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:46,383 INFO L470 AbstractCegarLoop]: Abstraction has 6405 states and 7956 transitions. [2021-12-06 18:19:46,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-06 18:19:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 7956 transitions. [2021-12-06 18:19:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-12-06 18:19:46,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:46,391 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, 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] [2021-12-06 18:19:46,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-06 18:19:46,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-06 18:19:46,593 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 886489051, now seen corresponding path program 1 times [2021-12-06 18:19:46,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:46,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041677935] [2021-12-06 18:19:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:46,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 18:19:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 18:19:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:19:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 18:19:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 18:19:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:19:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-06 18:19:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-06 18:19:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-12-06 18:19:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-06 18:19:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:19:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:19:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:19:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-06 18:19:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-06 18:19:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:19:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-12-06 18:19:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-06 18:19:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-12-06 18:19:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-06 18:19:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 18:19:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:19:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-06 18:19:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2021-12-06 18:19:46,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:46,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041677935] [2021-12-06 18:19:46,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041677935] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:46,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778437743] [2021-12-06 18:19:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:46,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:46,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:46,715 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:46,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 18:19:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:46,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:19:46,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-12-06 18:19:47,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:19:47,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778437743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:47,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:19:47,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:19:47,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766509542] [2021-12-06 18:19:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:47,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:19:47,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:19:47,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:19:47,032 INFO L87 Difference]: Start difference. First operand 6405 states and 7956 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:19:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:47,411 INFO L93 Difference]: Finished difference Result 12333 states and 15351 transitions. [2021-12-06 18:19:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 374 [2021-12-06 18:19:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:47,421 INFO L225 Difference]: With dead ends: 12333 [2021-12-06 18:19:47,421 INFO L226 Difference]: Without dead ends: 5929 [2021-12-06 18:19:47,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 442 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:19:47,427 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 28 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 697 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:19:47,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 697 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states. [2021-12-06 18:19:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 5713. [2021-12-06 18:19:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5713 states, 4416 states have (on average 1.229393115942029) internal successors, (5429), 4524 states have internal predecessors, (5429), 843 states have call successors, (843), 453 states have call predecessors, (843), 453 states have return successors, (843), 735 states have call predecessors, (843), 843 states have call successors, (843) [2021-12-06 18:19:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5713 states to 5713 states and 7115 transitions. [2021-12-06 18:19:47,762 INFO L78 Accepts]: Start accepts. Automaton has 5713 states and 7115 transitions. Word has length 374 [2021-12-06 18:19:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:47,762 INFO L470 AbstractCegarLoop]: Abstraction has 5713 states and 7115 transitions. [2021-12-06 18:19:47,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:19:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5713 states and 7115 transitions. [2021-12-06 18:19:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2021-12-06 18:19:47,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:47,770 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, 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] [2021-12-06 18:19:47,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 18:19:47,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-06 18:19:47,971 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2125967336, now seen corresponding path program 1 times [2021-12-06 18:19:47,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:47,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807326917] [2021-12-06 18:19:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:47,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:19:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:19:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:19:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:19:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:19:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:19:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:19:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-06 18:19:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:19:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:19:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:19:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-06 18:19:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-06 18:19:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-06 18:19:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-06 18:19:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-06 18:19:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-12-06 18:19:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 34 proven. 72 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-12-06 18:19:48,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:48,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807326917] [2021-12-06 18:19:48,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807326917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:48,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611725793] [2021-12-06 18:19:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:48,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:48,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:48,243 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:48,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 18:19:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:48,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 18:19:48,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 242 proven. 247 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2021-12-06 18:19:48,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2021-12-06 18:19:49,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611725793] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:49,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 18:19:49,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15, 17] total 28 [2021-12-06 18:19:49,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289113863] [2021-12-06 18:19:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:49,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:19:49,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:19:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2021-12-06 18:19:49,137 INFO L87 Difference]: Start difference. First operand 5713 states and 7115 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-12-06 18:19:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:49,441 INFO L93 Difference]: Finished difference Result 10858 states and 13578 transitions. [2021-12-06 18:19:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:19:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 381 [2021-12-06 18:19:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:49,451 INFO L225 Difference]: With dead ends: 10858 [2021-12-06 18:19:49,451 INFO L226 Difference]: Without dead ends: 5632 [2021-12-06 18:19:49,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2021-12-06 18:19:49,455 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:49,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 741 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:19:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2021-12-06 18:19:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5632. [2021-12-06 18:19:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 4345 states have (on average 1.2260069044879172) internal successors, (5327), 4448 states have internal predecessors, (5327), 838 states have call successors, (838), 448 states have call predecessors, (838), 448 states have return successors, (838), 735 states have call predecessors, (838), 838 states have call successors, (838) [2021-12-06 18:19:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7003 transitions. [2021-12-06 18:19:49,761 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7003 transitions. Word has length 381 [2021-12-06 18:19:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:49,761 INFO L470 AbstractCegarLoop]: Abstraction has 5632 states and 7003 transitions. [2021-12-06 18:19:49,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-12-06 18:19:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7003 transitions. [2021-12-06 18:19:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-12-06 18:19:49,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:49,769 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:49,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 18:19:49,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-06 18:19:49,971 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1983640200, now seen corresponding path program 1 times [2021-12-06 18:19:49,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:49,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491244703] [2021-12-06 18:19:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:49,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:19:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:19:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:19:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:19:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:19:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:19:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:19:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:19:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:19:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-06 18:19:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:19:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:19:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:19:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:19:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:19:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-06 18:19:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-06 18:19:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-12-06 18:19:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-12-06 18:19:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2021-12-06 18:19:50,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491244703] [2021-12-06 18:19:50,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491244703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:19:50,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:19:50,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:19:50,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820811400] [2021-12-06 18:19:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:19:50,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:19:50,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:19:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:19:50,127 INFO L87 Difference]: Start difference. First operand 5632 states and 7003 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-12-06 18:19:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:19:50,676 INFO L93 Difference]: Finished difference Result 11196 states and 13911 transitions. [2021-12-06 18:19:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:19:50,676 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), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 389 [2021-12-06 18:19:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:19:50,687 INFO L225 Difference]: With dead ends: 11196 [2021-12-06 18:19:50,687 INFO L226 Difference]: Without dead ends: 5819 [2021-12-06 18:19:50,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 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:19:50,693 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 367 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:19:50,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 506 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:19:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2021-12-06 18:19:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 2941. [2021-12-06 18:19:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2295 states have (on average 1.2069716775599129) internal successors, (2770), 2349 states have internal predecessors, (2770), 418 states have call successors, (418), 227 states have call predecessors, (418), 227 states have return successors, (418), 364 states have call predecessors, (418), 418 states have call successors, (418) [2021-12-06 18:19:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3606 transitions. [2021-12-06 18:19:50,921 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3606 transitions. Word has length 389 [2021-12-06 18:19:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:19:50,921 INFO L470 AbstractCegarLoop]: Abstraction has 2941 states and 3606 transitions. [2021-12-06 18:19:50,921 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), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-12-06 18:19:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3606 transitions. [2021-12-06 18:19:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-12-06 18:19:50,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:19:50,926 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:50,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-06 18:19:50,927 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:19:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:19:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -498617400, now seen corresponding path program 1 times [2021-12-06 18:19:50,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:19:50,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67957419] [2021-12-06 18:19:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:50,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:19:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:19:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:19:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:19:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:19:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:19:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:19:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:19:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:19:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:19:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:19:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:19:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:19:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:19:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:19:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:19:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:19:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:19:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:19:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:19:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:19:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:19:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:19:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:19:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:19:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:19:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:19:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-06 18:19:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:19:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:19:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:19:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:19:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:19:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-06 18:19:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-06 18:19:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-12-06 18:19:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-12-06 18:19:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2021-12-06 18:19:51,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:19:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67957419] [2021-12-06 18:19:51,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67957419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:19:51,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876138691] [2021-12-06 18:19:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:19:51,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:19:51,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:19:51,154 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:19:51,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 18:19:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:19:51,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 18:19:51,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:19:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 506 proven. 222 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-12-06 18:19:52,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:19:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 112 proven. 194 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2021-12-06 18:19:53,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876138691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:19:53,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:19:53,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 21] total 55 [2021-12-06 18:19:53,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672618567] [2021-12-06 18:19:53,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:19:53,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-06 18:19:53,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:19:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-06 18:19:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-12-06 18:19:53,377 INFO L87 Difference]: Start difference. First operand 2941 states and 3606 transitions. Second operand has 55 states, 55 states have (on average 7.109090909090909) internal successors, (391), 47 states have internal predecessors, (391), 18 states have call successors, (83), 14 states have call predecessors, (83), 21 states have return successors, (86), 23 states have call predecessors, (86), 18 states have call successors, (86) [2021-12-06 18:20:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:16,943 INFO L93 Difference]: Finished difference Result 20494 states and 27994 transitions. [2021-12-06 18:20:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 322 states. [2021-12-06 18:20:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.109090909090909) internal successors, (391), 47 states have internal predecessors, (391), 18 states have call successors, (83), 14 states have call predecessors, (83), 21 states have return successors, (86), 23 states have call predecessors, (86), 18 states have call successors, (86) Word has length 389 [2021-12-06 18:20:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:16,972 INFO L225 Difference]: With dead ends: 20494 [2021-12-06 18:20:16,972 INFO L226 Difference]: Without dead ends: 17997 [2021-12-06 18:20:16,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53303 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7953, Invalid=130803, Unknown=0, NotChecked=0, Total=138756 [2021-12-06 18:20:16,994 INFO L933 BasicCegarLoop]: 886 mSDtfsCounter, 5339 mSDsluCounter, 20283 mSDsCounter, 0 mSdLazyCounter, 31089 mSolverCounterSat, 3881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5357 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 34970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3881 IncrementalHoareTripleChecker+Valid, 31089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:16,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5357 Valid, 21169 Invalid, 34970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3881 Valid, 31089 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2021-12-06 18:20:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17997 states. [2021-12-06 18:20:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17997 to 6889. [2021-12-06 18:20:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6889 states, 5323 states have (on average 1.221491640052602) internal successors, (6502), 5481 states have internal predecessors, (6502), 1034 states have call successors, (1034), 531 states have call predecessors, (1034), 531 states have return successors, (1034), 876 states have call predecessors, (1034), 1034 states have call successors, (1034) [2021-12-06 18:20:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6889 states to 6889 states and 8570 transitions. [2021-12-06 18:20:17,727 INFO L78 Accepts]: Start accepts. Automaton has 6889 states and 8570 transitions. Word has length 389 [2021-12-06 18:20:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:17,727 INFO L470 AbstractCegarLoop]: Abstraction has 6889 states and 8570 transitions. [2021-12-06 18:20:17,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.109090909090909) internal successors, (391), 47 states have internal predecessors, (391), 18 states have call successors, (83), 14 states have call predecessors, (83), 21 states have return successors, (86), 23 states have call predecessors, (86), 18 states have call successors, (86) [2021-12-06 18:20:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6889 states and 8570 transitions. [2021-12-06 18:20:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 18:20:17,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:17,738 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:17,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 18:20:17,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:20:17,940 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 893049799, now seen corresponding path program 1 times [2021-12-06 18:20:17,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:17,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225918469] [2021-12-06 18:20:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:17,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:20:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:20:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:20:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:20:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:20:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:20:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:20:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:20:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:20:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-12-06 18:20:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:20:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-06 18:20:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-06 18:20:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:20:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:20:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-06 18:20:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-06 18:20:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:20:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:20:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:20:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2021-12-06 18:20:18,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225918469] [2021-12-06 18:20:18,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225918469] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:20:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879795088] [2021-12-06 18:20:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:18,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:20:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:20:18,216 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:20:18,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 18:20:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:18,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:20:18,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:20:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 569 proven. 233 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-12-06 18:20:19,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:20:20,073 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:20:20,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:20:20,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-06 18:20:20,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634402562] [2021-12-06 18:20:20,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:20:20,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:20:20,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:20:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-06 18:20:20,075 INFO L87 Difference]: Start difference. First operand 6889 states and 8570 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 15 states have internal predecessors, (137), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) [2021-12-06 18:20:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:28,515 INFO L93 Difference]: Finished difference Result 35176 states and 47671 transitions. [2021-12-06 18:20:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-06 18:20:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 15 states have internal predecessors, (137), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) Word has length 401 [2021-12-06 18:20:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:28,569 INFO L225 Difference]: With dead ends: 35176 [2021-12-06 18:20:28,569 INFO L226 Difference]: Without dead ends: 29004 [2021-12-06 18:20:28,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1967, Invalid=18055, Unknown=0, NotChecked=0, Total=20022 [2021-12-06 18:20:28,582 INFO L933 BasicCegarLoop]: 1113 mSDtfsCounter, 1503 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 8122 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 7771 SdHoareTripleChecker+Invalid, 9221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 8122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:28,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 7771 Invalid, 9221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 8122 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-06 18:20:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29004 states. [2021-12-06 18:20:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29004 to 8455. [2021-12-06 18:20:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 6515 states have (on average 1.2228702993092864) internal successors, (7967), 6729 states have internal predecessors, (7967), 1283 states have call successors, (1283), 656 states have call predecessors, (1283), 656 states have return successors, (1283), 1069 states have call predecessors, (1283), 1283 states have call successors, (1283) [2021-12-06 18:20:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 10533 transitions. [2021-12-06 18:20:29,672 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 10533 transitions. Word has length 401 [2021-12-06 18:20:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:29,672 INFO L470 AbstractCegarLoop]: Abstraction has 8455 states and 10533 transitions. [2021-12-06 18:20:29,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 15 states have internal predecessors, (137), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) [2021-12-06 18:20:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 10533 transitions. [2021-12-06 18:20:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 18:20:29,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:29,685 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:29,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 18:20:29,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:20:29,887 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1072936955, now seen corresponding path program 1 times [2021-12-06 18:20:29,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493721345] [2021-12-06 18:20:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:29,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:20:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:20:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:20:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:20:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:20:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:20:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:20:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:20:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:20:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-12-06 18:20:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:20:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-06 18:20:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-06 18:20:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:20:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:20:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-06 18:20:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-06 18:20:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:20:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:20:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:20:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2021-12-06 18:20:30,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493721345] [2021-12-06 18:20:30,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493721345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:20:30,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:20:30,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:20:30,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839522899] [2021-12-06 18:20:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:20:30,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:20:30,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:20:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:20:30,054 INFO L87 Difference]: Start difference. First operand 8455 states and 10533 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 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:20:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:31,168 INFO L93 Difference]: Finished difference Result 16390 states and 20444 transitions. [2021-12-06 18:20:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:20:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 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 401 [2021-12-06 18:20:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:31,182 INFO L225 Difference]: With dead ends: 16390 [2021-12-06 18:20:31,182 INFO L226 Difference]: Without dead ends: 8503 [2021-12-06 18:20:31,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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:20:31,190 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 282 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:31,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 460 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:20:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2021-12-06 18:20:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 5140. [2021-12-06 18:20:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5140 states, 4083 states have (on average 1.2253245162870439) internal successors, (5003), 4179 states have internal predecessors, (5003), 684 states have call successors, (684), 372 states have call predecessors, (684), 372 states have return successors, (684), 588 states have call predecessors, (684), 684 states have call successors, (684) [2021-12-06 18:20:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6371 transitions. [2021-12-06 18:20:31,901 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6371 transitions. Word has length 401 [2021-12-06 18:20:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:31,901 INFO L470 AbstractCegarLoop]: Abstraction has 5140 states and 6371 transitions. [2021-12-06 18:20:31,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 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:20:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6371 transitions. [2021-12-06 18:20:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 18:20:31,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:31,908 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:31,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-06 18:20:31,908 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1102366018, now seen corresponding path program 1 times [2021-12-06 18:20:31,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:31,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892302480] [2021-12-06 18:20:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:31,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-06 18:20:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-12-06 18:20:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 18:20:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:20:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:20:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:20:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:20:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:20:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:20:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-12-06 18:20:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:20:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-06 18:20:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-06 18:20:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:20:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:20:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-06 18:20:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-06 18:20:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:20:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:20:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:20:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2021-12-06 18:20:32,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:32,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892302480] [2021-12-06 18:20:32,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892302480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:20:32,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:20:32,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:20:32,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222428824] [2021-12-06 18:20:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:20:32,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:20:32,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:20:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:20:32,039 INFO L87 Difference]: Start difference. First operand 5140 states and 6371 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-06 18:20:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:32,947 INFO L93 Difference]: Finished difference Result 9837 states and 12261 transitions. [2021-12-06 18:20:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:20:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 401 [2021-12-06 18:20:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:32,955 INFO L225 Difference]: With dead ends: 9837 [2021-12-06 18:20:32,955 INFO L226 Difference]: Without dead ends: 5170 [2021-12-06 18:20:32,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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:20:32,959 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 279 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:32,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 507 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:20:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2021-12-06 18:20:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5166. [2021-12-06 18:20:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 4087 states have (on average 1.2251039882554442) internal successors, (5007), 4201 states have internal predecessors, (5007), 706 states have call successors, (706), 372 states have call predecessors, (706), 372 states have return successors, (706), 592 states have call predecessors, (706), 706 states have call successors, (706) [2021-12-06 18:20:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6419 transitions. [2021-12-06 18:20:33,648 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6419 transitions. Word has length 401 [2021-12-06 18:20:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:33,648 INFO L470 AbstractCegarLoop]: Abstraction has 5166 states and 6419 transitions. [2021-12-06 18:20:33,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-06 18:20:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6419 transitions. [2021-12-06 18:20:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 18:20:33,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:33,654 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:33,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-06 18:20:33,654 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2005286596, now seen corresponding path program 1 times [2021-12-06 18:20:33,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:33,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151798710] [2021-12-06 18:20:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:33,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-06 18:20:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-12-06 18:20:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 18:20:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:20:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:20:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:20:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:20:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:20:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:20:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-12-06 18:20:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:20:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-06 18:20:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-06 18:20:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:20:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:20:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-06 18:20:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-06 18:20:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:20:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:20:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:20:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2021-12-06 18:20:33,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151798710] [2021-12-06 18:20:33,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151798710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:20:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500827563] [2021-12-06 18:20:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:33,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:20:33,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:20:33,837 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:20:33,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 18:20:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:33,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:20:33,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:20:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 575 proven. 233 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-12-06 18:20:34,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:20:35,666 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:20:35,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:20:35,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-06 18:20:35,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404972084] [2021-12-06 18:20:35,667 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:20:35,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:20:35,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:35,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:20:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2369, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 18:20:35,668 INFO L87 Difference]: Start difference. First operand 5166 states and 6419 transitions. Second operand has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 13 states have internal predecessors, (137), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2021-12-06 18:20:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:44,874 INFO L93 Difference]: Finished difference Result 28583 states and 37784 transitions. [2021-12-06 18:20:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-12-06 18:20:44,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 13 states have internal predecessors, (137), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 401 [2021-12-06 18:20:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:44,908 INFO L225 Difference]: With dead ends: 28583 [2021-12-06 18:20:44,908 INFO L226 Difference]: Without dead ends: 24162 [2021-12-06 18:20:44,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7119 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2255, Invalid=23505, Unknown=0, NotChecked=0, Total=25760 [2021-12-06 18:20:44,917 INFO L933 BasicCegarLoop]: 1120 mSDtfsCounter, 1519 mSDsluCounter, 7244 mSDsCounter, 0 mSdLazyCounter, 8249 mSolverCounterSat, 1265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 8364 SdHoareTripleChecker+Invalid, 9514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1265 IncrementalHoareTripleChecker+Valid, 8249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:44,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 8364 Invalid, 9514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1265 Valid, 8249 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-06 18:20:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24162 states. [2021-12-06 18:20:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24162 to 5140. [2021-12-06 18:20:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5140 states, 4083 states have (on average 1.2253245162870439) internal successors, (5003), 4179 states have internal predecessors, (5003), 684 states have call successors, (684), 372 states have call predecessors, (684), 372 states have return successors, (684), 588 states have call predecessors, (684), 684 states have call successors, (684) [2021-12-06 18:20:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6371 transitions. [2021-12-06 18:20:45,806 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6371 transitions. Word has length 401 [2021-12-06 18:20:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:45,806 INFO L470 AbstractCegarLoop]: Abstraction has 5140 states and 6371 transitions. [2021-12-06 18:20:45,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 13 states have internal predecessors, (137), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2021-12-06 18:20:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6371 transitions. [2021-12-06 18:20:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:20:45,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:45,812 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:45,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-06 18:20:46,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-06 18:20:46,013 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -523976541, now seen corresponding path program 1 times [2021-12-06 18:20:46,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780444080] [2021-12-06 18:20:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:46,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:20:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-06 18:20:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 18:20:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:20:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:20:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:20:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:20:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:20:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:20:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:20:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:20:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:20:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:20:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:20:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:20:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:20:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:20:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:20:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:20:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:20:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2021-12-06 18:20:46,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:46,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780444080] [2021-12-06 18:20:46,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780444080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:20:46,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67997948] [2021-12-06 18:20:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:46,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:20:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:20:46,254 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:20:46,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 18:20:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:46,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:20:46,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:20:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 569 proven. 233 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-12-06 18:20:47,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:20:48,080 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:20:48,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:20:48,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-06 18:20:48,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612008709] [2021-12-06 18:20:48,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:20:48,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:20:48,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:48,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:20:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-06 18:20:48,081 INFO L87 Difference]: Start difference. First operand 5140 states and 6371 transitions. Second operand has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 15 states have internal predecessors, (138), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) [2021-12-06 18:20:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:57,261 INFO L93 Difference]: Finished difference Result 23780 states and 31240 transitions. [2021-12-06 18:20:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-12-06 18:20:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 15 states have internal predecessors, (138), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) Word has length 402 [2021-12-06 18:20:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:57,288 INFO L225 Difference]: With dead ends: 23780 [2021-12-06 18:20:57,288 INFO L226 Difference]: Without dead ends: 19383 [2021-12-06 18:20:57,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1976, Invalid=18330, Unknown=0, NotChecked=0, Total=20306 [2021-12-06 18:20:57,295 INFO L933 BasicCegarLoop]: 1039 mSDtfsCounter, 1540 mSDsluCounter, 6308 mSDsCounter, 0 mSdLazyCounter, 7807 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 7347 SdHoareTripleChecker+Invalid, 9014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 7807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:57,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 7347 Invalid, 9014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1207 Valid, 7807 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-06 18:20:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19383 states. [2021-12-06 18:20:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19383 to 5156. [2021-12-06 18:20:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 4091 states have (on average 1.2268394035688095) internal successors, (5019), 4187 states have internal predecessors, (5019), 692 states have call successors, (692), 372 states have call predecessors, (692), 372 states have return successors, (692), 596 states have call predecessors, (692), 692 states have call successors, (692) [2021-12-06 18:20:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 6403 transitions. [2021-12-06 18:20:58,205 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 6403 transitions. Word has length 402 [2021-12-06 18:20:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:20:58,205 INFO L470 AbstractCegarLoop]: Abstraction has 5156 states and 6403 transitions. [2021-12-06 18:20:58,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.117647058823529) internal successors, (138), 15 states have internal predecessors, (138), 8 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 9 states have call predecessors, (30), 8 states have call successors, (30) [2021-12-06 18:20:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 6403 transitions. [2021-12-06 18:20:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:20:58,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:20:58,211 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:58,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 18:20:58,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-06 18:20:58,412 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:20:58,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:20:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1805004001, now seen corresponding path program 1 times [2021-12-06 18:20:58,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:20:58,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557970290] [2021-12-06 18:20:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:20:58,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:20:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:20:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:20:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:20:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:20:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:20:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:20:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:20:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:20:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:20:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:20:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:20:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:20:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:20:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:20:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:20:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:20:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:20:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:20:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-06 18:20:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 18:20:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:20:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:20:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:20:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:20:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:20:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:20:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:20:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:20:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:20:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:20:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:20:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:20:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:20:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:20:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:20:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:20:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:20:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:20:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2021-12-06 18:20:58,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:20:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557970290] [2021-12-06 18:20:58,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557970290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:20:58,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:20:58,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:20:58,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465351057] [2021-12-06 18:20:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:20:58,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:20:58,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:20:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:20:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:20:58,568 INFO L87 Difference]: Start difference. First operand 5156 states and 6403 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:20:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:20:59,583 INFO L93 Difference]: Finished difference Result 9833 states and 12260 transitions. [2021-12-06 18:20:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:20:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 402 [2021-12-06 18:20:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:20:59,590 INFO L225 Difference]: With dead ends: 9833 [2021-12-06 18:20:59,590 INFO L226 Difference]: Without dead ends: 5176 [2021-12-06 18:20:59,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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:20:59,594 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 378 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:20:59,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 463 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:20:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2021-12-06 18:21:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 5140. [2021-12-06 18:21:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5140 states, 4083 states have (on average 1.2253245162870439) internal successors, (5003), 4179 states have internal predecessors, (5003), 684 states have call successors, (684), 372 states have call predecessors, (684), 372 states have return successors, (684), 588 states have call predecessors, (684), 684 states have call successors, (684) [2021-12-06 18:21:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6371 transitions. [2021-12-06 18:21:00,403 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6371 transitions. Word has length 402 [2021-12-06 18:21:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:21:00,403 INFO L470 AbstractCegarLoop]: Abstraction has 5140 states and 6371 transitions. [2021-12-06 18:21:00,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:21:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6371 transitions. [2021-12-06 18:21:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:21:00,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:21:00,409 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:00,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-06 18:21:00,409 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:21:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:21:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1205274934, now seen corresponding path program 1 times [2021-12-06 18:21:00,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:21:00,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320330664] [2021-12-06 18:21:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:00,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:21:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:21:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:21:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:21:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:21:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:21:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:21:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:21:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:21:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:21:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:21:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:21:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:21:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:21:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:21:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:21:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:21:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:21:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:21:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-12-06 18:21:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:21:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:21:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:21:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:21:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:21:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:21:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:21:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:21:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:21:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:21:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:21:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:21:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:21:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:21:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:21:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:21:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:21:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2021-12-06 18:21:00,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:21:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320330664] [2021-12-06 18:21:00,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320330664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:21:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914360954] [2021-12-06 18:21:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:00,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:21:00,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:21:00,651 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:21:00,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 18:21:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:00,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:21:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:21:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 569 proven. 229 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-12-06 18:21:01,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:21:02,538 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:21:02,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:21:02,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-06 18:21:02,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796889879] [2021-12-06 18:21:02,538 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:21:02,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:21:02,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:21:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:21:02,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 18:21:02,540 INFO L87 Difference]: Start difference. First operand 5140 states and 6371 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 12 states have internal predecessors, (148), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2021-12-06 18:21:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:21:07,121 INFO L93 Difference]: Finished difference Result 18621 states and 23577 transitions. [2021-12-06 18:21:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 18:21:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 12 states have internal predecessors, (148), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) Word has length 402 [2021-12-06 18:21:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:21:07,142 INFO L225 Difference]: With dead ends: 18621 [2021-12-06 18:21:07,142 INFO L226 Difference]: Without dead ends: 14224 [2021-12-06 18:21:07,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=810, Invalid=6672, Unknown=0, NotChecked=0, Total=7482 [2021-12-06 18:21:07,148 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 1070 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:21:07,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1113 Valid, 3905 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-06 18:21:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14224 states. [2021-12-06 18:21:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14224 to 10060. [2021-12-06 18:21:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10060 states, 7956 states have (on average 1.2219708396178985) internal successors, (9722), 8112 states have internal predecessors, (9722), 1359 states have call successors, (1359), 744 states have call predecessors, (1359), 744 states have return successors, (1359), 1203 states have call predecessors, (1359), 1359 states have call successors, (1359) [2021-12-06 18:21:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10060 states to 10060 states and 12440 transitions. [2021-12-06 18:21:08,868 INFO L78 Accepts]: Start accepts. Automaton has 10060 states and 12440 transitions. Word has length 402 [2021-12-06 18:21:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:21:08,868 INFO L470 AbstractCegarLoop]: Abstraction has 10060 states and 12440 transitions. [2021-12-06 18:21:08,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 12 states have internal predecessors, (148), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2021-12-06 18:21:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10060 states and 12440 transitions. [2021-12-06 18:21:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:21:08,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:21:08,878 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:08,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-06 18:21:09,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-06 18:21:09,080 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:21:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:21:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1448629014, now seen corresponding path program 1 times [2021-12-06 18:21:09,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:21:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893395797] [2021-12-06 18:21:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:09,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:21:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:21:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:21:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:21:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:21:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:21:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:21:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:21:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:21:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:21:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:21:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:21:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:21:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:21:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:21:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:21:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:21:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:21:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:21:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-12-06 18:21:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:21:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:21:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:21:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:21:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:21:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:21:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:21:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:21:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:21:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:21:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:21:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:21:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:21:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:21:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:21:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-12-06 18:21:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:21:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 52 proven. 51 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2021-12-06 18:21:09,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:21:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893395797] [2021-12-06 18:21:09,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893395797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:21:09,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454278286] [2021-12-06 18:21:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:09,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:21:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:21:09,285 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:21:09,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 18:21:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:09,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:21:09,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:21:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 566 proven. 229 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-12-06 18:21:10,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:21:11,116 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:21:11,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:21:11,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-06 18:21:11,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416502115] [2021-12-06 18:21:11,116 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:21:11,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:21:11,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:21:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:21:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 18:21:11,117 INFO L87 Difference]: Start difference. First operand 10060 states and 12440 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-06 18:21:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:21:19,641 INFO L93 Difference]: Finished difference Result 43513 states and 54748 transitions. [2021-12-06 18:21:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-06 18:21:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) Word has length 402 [2021-12-06 18:21:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:21:19,701 INFO L225 Difference]: With dead ends: 43513 [2021-12-06 18:21:19,702 INFO L226 Difference]: Without dead ends: 34397 [2021-12-06 18:21:19,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=652, Invalid=7180, Unknown=0, NotChecked=0, Total=7832 [2021-12-06 18:21:19,715 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 1086 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 2817 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 4232 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:21:19,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 4232 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2817 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-06 18:21:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34397 states. [2021-12-06 18:21:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34397 to 15228. [2021-12-06 18:21:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15228 states, 11865 states have (on average 1.2129793510324485) internal successors, (14392), 12114 states have internal predecessors, (14392), 2184 states have call successors, (2184), 1178 states have call predecessors, (2184), 1178 states have return successors, (2184), 1935 states have call predecessors, (2184), 2184 states have call successors, (2184) [2021-12-06 18:21:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15228 states to 15228 states and 18760 transitions. [2021-12-06 18:21:22,625 INFO L78 Accepts]: Start accepts. Automaton has 15228 states and 18760 transitions. Word has length 402 [2021-12-06 18:21:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:21:22,625 INFO L470 AbstractCegarLoop]: Abstraction has 15228 states and 18760 transitions. [2021-12-06 18:21:22,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (30), 6 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-06 18:21:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 15228 states and 18760 transitions. [2021-12-06 18:21:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:21:22,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:21:22,642 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:22,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-06 18:21:22,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-12-06 18:21:22,843 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:21:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:21:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash 384103264, now seen corresponding path program 1 times [2021-12-06 18:21:22,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:21:22,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966063977] [2021-12-06 18:21:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:22,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:21:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:21:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:21:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:21:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:21:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:21:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:21:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:21:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:21:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:21:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:21:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:21:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:21:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:21:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:21:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:21:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:21:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:21:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:21:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:21:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:21:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:21:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:21:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:21:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:21:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:21:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:21:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:21:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:21:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:21:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:21:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:21:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:21:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:21:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:21:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:21:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:21:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2021-12-06 18:21:22,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:21:22,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966063977] [2021-12-06 18:21:22,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966063977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:21:22,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:21:22,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:21:22,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921602034] [2021-12-06 18:21:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:21:22,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:21:22,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:21:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:21:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:21:22,993 INFO L87 Difference]: Start difference. First operand 15228 states and 18760 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-06 18:21:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:21:25,827 INFO L93 Difference]: Finished difference Result 29999 states and 37064 transitions. [2021-12-06 18:21:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:21:25,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 402 [2021-12-06 18:21:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:21:25,852 INFO L225 Difference]: With dead ends: 29999 [2021-12-06 18:21:25,852 INFO L226 Difference]: Without dead ends: 15311 [2021-12-06 18:21:25,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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:21:25,866 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 365 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:21:25,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 462 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:21:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15311 states. [2021-12-06 18:21:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15311 to 15302. [2021-12-06 18:21:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15302 states, 11874 states have (on average 1.2128179215091797) internal successors, (14401), 12179 states have internal predecessors, (14401), 2249 states have call successors, (2249), 1178 states have call predecessors, (2249), 1178 states have return successors, (2249), 1944 states have call predecessors, (2249), 2249 states have call successors, (2249) [2021-12-06 18:21:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 18899 transitions. [2021-12-06 18:21:28,733 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 18899 transitions. Word has length 402 [2021-12-06 18:21:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:21:28,733 INFO L470 AbstractCegarLoop]: Abstraction has 15302 states and 18899 transitions. [2021-12-06 18:21:28,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 5 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2021-12-06 18:21:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 18899 transitions. [2021-12-06 18:21:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:21:28,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:21:28,750 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:28,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-06 18:21:28,751 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:21:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:21:28,751 INFO L85 PathProgramCache]: Analyzing trace with hash -518817314, now seen corresponding path program 1 times [2021-12-06 18:21:28,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:21:28,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569773422] [2021-12-06 18:21:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:28,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:21:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:21:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:21:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:21:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:21:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:21:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:21:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:21:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:21:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:21:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:21:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:21:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:21:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:21:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:21:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:21:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:21:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:21:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:21:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:21:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:21:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:21:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:21:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:21:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:21:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:21:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:21:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:21:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:21:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:21:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:21:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:21:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:21:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:21:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:21:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:21:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:21:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2021-12-06 18:21:28,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:21:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569773422] [2021-12-06 18:21:28,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569773422] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:21:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879218077] [2021-12-06 18:21:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:28,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:21:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:21:28,925 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:21:28,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-06 18:21:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:29,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:21:29,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:21:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 575 proven. 233 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-12-06 18:21:30,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:21:30,840 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:21:30,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:21:30,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-06 18:21:30,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632855492] [2021-12-06 18:21:30,841 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:21:30,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:21:30,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:21:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:21:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2369, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 18:21:30,842 INFO L87 Difference]: Start difference. First operand 15302 states and 18899 transitions. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 13 states have internal predecessors, (138), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2021-12-06 18:21:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:21:52,175 INFO L93 Difference]: Finished difference Result 88058 states and 115339 transitions. [2021-12-06 18:21:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-12-06 18:21:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 13 states have internal predecessors, (138), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) Word has length 402 [2021-12-06 18:21:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:21:52,319 INFO L225 Difference]: With dead ends: 88058 [2021-12-06 18:21:52,319 INFO L226 Difference]: Without dead ends: 73836 [2021-12-06 18:21:52,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2255, Invalid=23505, Unknown=0, NotChecked=0, Total=25760 [2021-12-06 18:21:52,346 INFO L933 BasicCegarLoop]: 1138 mSDtfsCounter, 1482 mSDsluCounter, 7392 mSDsCounter, 0 mSdLazyCounter, 8342 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 8530 SdHoareTripleChecker+Invalid, 9490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 8342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:21:52,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 8530 Invalid, 9490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 8342 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-06 18:21:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73836 states. [2021-12-06 18:21:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73836 to 16510. [2021-12-06 18:21:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16510 states, 12818 states have (on average 1.2148541114058355) internal successors, (15572), 13140 states have internal predecessors, (15572), 2419 states have call successors, (2419), 1272 states have call predecessors, (2419), 1272 states have return successors, (2419), 2097 states have call predecessors, (2419), 2419 states have call successors, (2419) [2021-12-06 18:21:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16510 states to 16510 states and 20410 transitions. [2021-12-06 18:21:56,060 INFO L78 Accepts]: Start accepts. Automaton has 16510 states and 20410 transitions. Word has length 402 [2021-12-06 18:21:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:21:56,061 INFO L470 AbstractCegarLoop]: Abstraction has 16510 states and 20410 transitions. [2021-12-06 18:21:56,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 13 states have internal predecessors, (138), 7 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 8 states have call predecessors, (30), 7 states have call successors, (30) [2021-12-06 18:21:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 16510 states and 20410 transitions. [2021-12-06 18:21:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2021-12-06 18:21:56,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:21:56,078 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:21:56,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-06 18:21:56,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:21:56,280 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:21:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:21:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1696480414, now seen corresponding path program 1 times [2021-12-06 18:21:56,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:21:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25041124] [2021-12-06 18:21:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:56,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:21:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:21:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:21:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:21:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:21:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:21:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:21:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:21:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:21:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:21:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:21:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:21:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:21:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:21:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:21:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:21:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:21:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:21:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:21:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:21:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:21:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:21:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:21:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:21:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:21:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:21:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:21:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-06 18:21:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:21:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:21:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-06 18:21:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:21:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:21:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:21:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:21:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:21:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:21:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:21:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 148 proven. 128 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2021-12-06 18:21:56,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:21:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25041124] [2021-12-06 18:21:56,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25041124] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:21:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619746365] [2021-12-06 18:21:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:21:56,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:21:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:21:56,541 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:21:56,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-06 18:21:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:21:56,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 18:21:56,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:21:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 385 proven. 52 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2021-12-06 18:21:57,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:21:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 59 proven. 48 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2021-12-06 18:21:57,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619746365] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:21:57,626 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:21:57,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 32 [2021-12-06 18:21:57,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999780025] [2021-12-06 18:21:57,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:21:57,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-06 18:21:57,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:21:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-06 18:21:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2021-12-06 18:21:57,627 INFO L87 Difference]: Start difference. First operand 16510 states and 20410 transitions. Second operand has 32 states, 30 states have (on average 10.133333333333333) internal successors, (304), 27 states have internal predecessors, (304), 9 states have call successors, (67), 7 states have call predecessors, (67), 14 states have return successors, (66), 11 states have call predecessors, (66), 9 states have call successors, (66) [2021-12-06 18:22:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:22:07,290 INFO L93 Difference]: Finished difference Result 39206 states and 49491 transitions. [2021-12-06 18:22:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-12-06 18:22:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 10.133333333333333) internal successors, (304), 27 states have internal predecessors, (304), 9 states have call successors, (67), 7 states have call predecessors, (67), 14 states have return successors, (66), 11 states have call predecessors, (66), 9 states have call successors, (66) Word has length 402 [2021-12-06 18:22:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:22:07,329 INFO L225 Difference]: With dead ends: 39206 [2021-12-06 18:22:07,329 INFO L226 Difference]: Without dead ends: 23192 [2021-12-06 18:22:07,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 870 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=785, Invalid=8145, Unknown=0, NotChecked=0, Total=8930 [2021-12-06 18:22:07,390 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 1546 mSDsluCounter, 9931 mSDsCounter, 0 mSdLazyCounter, 5149 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 10584 SdHoareTripleChecker+Invalid, 5622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 5149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:22:07,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 10584 Invalid, 5622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 5149 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-06 18:22:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2021-12-06 18:22:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 10545. [2021-12-06 18:22:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 8307 states have (on average 1.2151197785000603) internal successors, (10094), 8444 states have internal predecessors, (10094), 1438 states have call successors, (1438), 799 states have call predecessors, (1438), 799 states have return successors, (1438), 1301 states have call predecessors, (1438), 1438 states have call successors, (1438) [2021-12-06 18:22:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 12970 transitions. [2021-12-06 18:22:09,980 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 12970 transitions. Word has length 402 [2021-12-06 18:22:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:22:09,980 INFO L470 AbstractCegarLoop]: Abstraction has 10545 states and 12970 transitions. [2021-12-06 18:22:09,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 10.133333333333333) internal successors, (304), 27 states have internal predecessors, (304), 9 states have call successors, (67), 7 states have call predecessors, (67), 14 states have return successors, (66), 11 states have call predecessors, (66), 9 states have call successors, (66) [2021-12-06 18:22:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 12970 transitions. [2021-12-06 18:22:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-12-06 18:22:09,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:22:09,989 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:22:10,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-06 18:22:10,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:22:10,190 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:22:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:22:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1567453097, now seen corresponding path program 1 times [2021-12-06 18:22:10,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:22:10,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768524688] [2021-12-06 18:22:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:22:10,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:22:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:22:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:22:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:22:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:22:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:22:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:22:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:22:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:22:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:22:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:22:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:22:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:22:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:22:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:22:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:22:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:22:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:22:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:22:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:22:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:22:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:22:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:22:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 18:22:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:22:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:22:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-06 18:22:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:22:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:22:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:22:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:22:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-06 18:22:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-06 18:22:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:22:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:22:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-06 18:22:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2021-12-06 18:22:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:22:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:22:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2021-12-06 18:22:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-12-06 18:22:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-06 18:22:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2021-12-06 18:22:10,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:22:10,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768524688] [2021-12-06 18:22:10,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768524688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:22:10,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561833549] [2021-12-06 18:22:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:22:10,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:22:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:22:10,355 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:22:10,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-06 18:22:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:10,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 1481 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 18:22:10,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:22:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 446 proven. 56 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2021-12-06 18:22:10,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:22:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 54 proven. 34 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2021-12-06 18:22:11,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561833549] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:22:11,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:22:11,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 10] total 26 [2021-12-06 18:22:11,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942865315] [2021-12-06 18:22:11,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:22:11,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 18:22:11,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:22:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 18:22:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-12-06 18:22:11,294 INFO L87 Difference]: Start difference. First operand 10545 states and 12970 transitions. Second operand has 26 states, 23 states have (on average 11.652173913043478) internal successors, (268), 23 states have internal predecessors, (268), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2021-12-06 18:22:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:22:15,862 INFO L93 Difference]: Finished difference Result 22764 states and 28528 transitions. [2021-12-06 18:22:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 18:22:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 11.652173913043478) internal successors, (268), 23 states have internal predecessors, (268), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 429 [2021-12-06 18:22:15,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:22:15,882 INFO L225 Difference]: With dead ends: 22764 [2021-12-06 18:22:15,882 INFO L226 Difference]: Without dead ends: 12575 [2021-12-06 18:22:15,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=2039, Unknown=0, NotChecked=0, Total=2352 [2021-12-06 18:22:15,893 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 443 mSDsluCounter, 3994 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 18:22:15,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 4344 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 18:22:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2021-12-06 18:22:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 10545. [2021-12-06 18:22:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 8307 states have (on average 1.2115083664379438) internal successors, (10064), 8444 states have internal predecessors, (10064), 1438 states have call successors, (1438), 799 states have call predecessors, (1438), 799 states have return successors, (1438), 1301 states have call predecessors, (1438), 1438 states have call successors, (1438) [2021-12-06 18:22:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 12940 transitions. [2021-12-06 18:22:18,271 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 12940 transitions. Word has length 429 [2021-12-06 18:22:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:22:18,271 INFO L470 AbstractCegarLoop]: Abstraction has 10545 states and 12940 transitions. [2021-12-06 18:22:18,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 11.652173913043478) internal successors, (268), 23 states have internal predecessors, (268), 9 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2021-12-06 18:22:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 12940 transitions. [2021-12-06 18:22:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-12-06 18:22:18,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:22:18,280 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:22:18,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-12-06 18:22:18,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-12-06 18:22:18,482 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:22:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:22:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 506567705, now seen corresponding path program 1 times [2021-12-06 18:22:18,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:22:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558991531] [2021-12-06 18:22:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:22:18,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:22:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:22:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:22:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:22:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:22:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:22:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:22:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:22:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:22:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:22:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:22:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:22:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:22:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:22:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:22:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:22:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:22:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:22:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:22:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:22:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:22:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:22:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:22:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 18:22:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:22:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:22:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-06 18:22:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:22:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:22:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:22:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:22:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-06 18:22:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-06 18:22:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:22:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:22:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-06 18:22:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2021-12-06 18:22:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:22:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:22:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2021-12-06 18:22:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-12-06 18:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-06 18:22:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2021-12-06 18:22:18,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:22:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558991531] [2021-12-06 18:22:18,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558991531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:22:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546567623] [2021-12-06 18:22:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:22:18,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:22:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:22:18,756 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:22:18,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-06 18:22:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:22:18,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 18:22:18,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:22:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 471 proven. 107 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2021-12-06 18:22:19,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:22:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2021-12-06 18:22:19,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546567623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:22:19,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:22:19,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 36 [2021-12-06 18:22:19,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816661537] [2021-12-06 18:22:19,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:22:19,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-06 18:22:19,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:22:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-06 18:22:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 18:22:19,966 INFO L87 Difference]: Start difference. First operand 10545 states and 12940 transitions. Second operand has 36 states, 36 states have (on average 11.25) internal successors, (405), 33 states have internal predecessors, (405), 17 states have call successors, (90), 7 states have call predecessors, (90), 9 states have return successors, (90), 19 states have call predecessors, (90), 17 states have call successors, (90) [2021-12-06 18:23:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:23:24,540 INFO L93 Difference]: Finished difference Result 114175 states and 152076 transitions. [2021-12-06 18:23:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 615 states. [2021-12-06 18:23:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 11.25) internal successors, (405), 33 states have internal predecessors, (405), 17 states have call successors, (90), 7 states have call predecessors, (90), 9 states have return successors, (90), 19 states have call predecessors, (90), 17 states have call successors, (90) Word has length 429 [2021-12-06 18:23:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:23:24,765 INFO L225 Difference]: With dead ends: 114175 [2021-12-06 18:23:24,765 INFO L226 Difference]: Without dead ends: 104383 [2021-12-06 18:23:24,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1605 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180773 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=39246, Invalid=372276, Unknown=0, NotChecked=0, Total=411522 [2021-12-06 18:23:24,814 INFO L933 BasicCegarLoop]: 3057 mSDtfsCounter, 3514 mSDsluCounter, 32194 mSDsCounter, 0 mSdLazyCounter, 44429 mSolverCounterSat, 5982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3553 SdHoareTripleChecker+Valid, 35251 SdHoareTripleChecker+Invalid, 50411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5982 IncrementalHoareTripleChecker+Valid, 44429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:23:24,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3553 Valid, 35251 Invalid, 50411 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5982 Valid, 44429 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2021-12-06 18:23:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104383 states. [2021-12-06 18:23:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104383 to 16078. [2021-12-06 18:23:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16078 states, 12638 states have (on average 1.223848710238962) internal successors, (15467), 12871 states have internal predecessors, (15467), 2212 states have call successors, (2212), 1227 states have call predecessors, (2212), 1227 states have return successors, (2212), 1979 states have call predecessors, (2212), 2212 states have call successors, (2212) [2021-12-06 18:23:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 19891 transitions. [2021-12-06 18:23:29,760 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 19891 transitions. Word has length 429 [2021-12-06 18:23:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:23:29,760 INFO L470 AbstractCegarLoop]: Abstraction has 16078 states and 19891 transitions. [2021-12-06 18:23:29,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.25) internal successors, (405), 33 states have internal predecessors, (405), 17 states have call successors, (90), 7 states have call predecessors, (90), 9 states have return successors, (90), 19 states have call predecessors, (90), 17 states have call successors, (90) [2021-12-06 18:23:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 19891 transitions. [2021-12-06 18:23:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-12-06 18:23:29,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:23:29,773 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:23:29,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-12-06 18:23:29,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-12-06 18:23:29,975 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:23:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:23:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -361359657, now seen corresponding path program 1 times [2021-12-06 18:23:29,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:23:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163848551] [2021-12-06 18:23:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:23:29,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:23:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:23:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:23:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:23:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:23:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:23:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:23:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:23:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:23:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:23:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:23:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:23:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:23:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:23:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:23:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:23:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:23:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:23:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:23:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:23:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:23:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-06 18:23:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:23:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 18:23:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:23:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:23:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-06 18:23:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:23:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:23:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:23:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:23:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-06 18:23:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-06 18:23:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-06 18:23:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 18:23:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-06 18:23:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2021-12-06 18:23:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:23:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2021-12-06 18:23:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2021-12-06 18:23:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2021-12-06 18:23:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-06 18:23:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2021-12-06 18:23:30,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:23:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163848551] [2021-12-06 18:23:30,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163848551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:23:30,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:23:30,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:23:30,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856579806] [2021-12-06 18:23:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:23:30,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:23:30,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:23:30,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:23:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:23:30,140 INFO L87 Difference]: Start difference. First operand 16078 states and 19891 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 5 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2021-12-06 18:23:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:23:33,563 INFO L93 Difference]: Finished difference Result 26872 states and 33336 transitions. [2021-12-06 18:23:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:23:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 5 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 429 [2021-12-06 18:23:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:23:33,582 INFO L225 Difference]: With dead ends: 26872 [2021-12-06 18:23:33,582 INFO L226 Difference]: Without dead ends: 11470 [2021-12-06 18:23:33,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 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:23:33,598 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 277 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:23:33,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 458 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:23:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2021-12-06 18:23:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 11440. [2021-12-06 18:23:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11440 states, 8917 states have (on average 1.219131995065605) internal successors, (10871), 9103 states have internal predecessors, (10871), 1635 states have call successors, (1635), 887 states have call predecessors, (1635), 887 states have return successors, (1635), 1449 states have call predecessors, (1635), 1635 states have call successors, (1635) [2021-12-06 18:23:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 14141 transitions. [2021-12-06 18:23:36,897 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 14141 transitions. Word has length 429 [2021-12-06 18:23:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:23:36,897 INFO L470 AbstractCegarLoop]: Abstraction has 11440 states and 14141 transitions. [2021-12-06 18:23:36,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 5 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2021-12-06 18:23:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 14141 transitions. [2021-12-06 18:23:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-12-06 18:23:36,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:23:36,907 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 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, 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:23:36,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-12-06 18:23:36,907 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:23:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:23:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1198550479, now seen corresponding path program 1 times [2021-12-06 18:23:36,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:23:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295610515] [2021-12-06 18:23:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:23:36,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:23:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:23:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:23:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:23:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:23:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:23:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:23:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:23:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:23:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:23:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:23:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:23:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:23:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:23:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:23:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:23:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:23:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:23:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:23:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:23:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:23:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:23:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:23:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:23:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:23:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:23:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:23:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:23:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:23:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:23:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-12-06 18:23:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-06 18:23:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:23:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:23:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:23:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:23:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2021-12-06 18:23:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-12-06 18:23:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-06 18:23:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2021-12-06 18:23:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2021-12-06 18:23:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2021-12-06 18:23:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-12-06 18:23:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2021-12-06 18:23:37,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:23:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295610515] [2021-12-06 18:23:37,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295610515] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:23:37,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460761140] [2021-12-06 18:23:37,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:23:37,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:23:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:23:37,032 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:23:37,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-06 18:23:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:23:37,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 18:23:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:23:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 187 proven. 409 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2021-12-06 18:23:37,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:23:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 23 proven. 39 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2021-12-06 18:23:37,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460761140] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:23:37,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:23:37,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-12-06 18:23:37,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018047927] [2021-12-06 18:23:37,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:23:37,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 18:23:37,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:23:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 18:23:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-12-06 18:23:37,856 INFO L87 Difference]: Start difference. First operand 11440 states and 14141 transitions. Second operand has 20 states, 20 states have (on average 15.8) internal successors, (316), 17 states have internal predecessors, (316), 7 states have call successors, (93), 7 states have call predecessors, (93), 9 states have return successors, (92), 9 states have call predecessors, (92), 7 states have call successors, (92) [2021-12-06 18:24:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:24:08,682 INFO L93 Difference]: Finished difference Result 67062 states and 89689 transitions. [2021-12-06 18:24:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-12-06 18:24:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.8) internal successors, (316), 17 states have internal predecessors, (316), 7 states have call successors, (93), 7 states have call predecessors, (93), 9 states have return successors, (92), 9 states have call predecessors, (92), 7 states have call successors, (92) Word has length 433 [2021-12-06 18:24:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:24:08,789 INFO L225 Difference]: With dead ends: 67062 [2021-12-06 18:24:08,789 INFO L226 Difference]: Without dead ends: 56457 [2021-12-06 18:24:08,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 986 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1160, Invalid=11722, Unknown=0, NotChecked=0, Total=12882 [2021-12-06 18:24:08,809 INFO L933 BasicCegarLoop]: 636 mSDtfsCounter, 2999 mSDsluCounter, 7125 mSDsCounter, 0 mSdLazyCounter, 6654 mSolverCounterSat, 1491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3014 SdHoareTripleChecker+Valid, 7761 SdHoareTripleChecker+Invalid, 8145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1491 IncrementalHoareTripleChecker+Valid, 6654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:24:08,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3014 Valid, 7761 Invalid, 8145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1491 Valid, 6654 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-06 18:24:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56457 states. [2021-12-06 18:24:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56457 to 18625. [2021-12-06 18:24:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18625 states, 14614 states have (on average 1.211372656356918) internal successors, (17703), 14921 states have internal predecessors, (17703), 2522 states have call successors, (2522), 1488 states have call predecessors, (2522), 1488 states have return successors, (2522), 2215 states have call predecessors, (2522), 2522 states have call successors, (2522) [2021-12-06 18:24:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18625 states to 18625 states and 22747 transitions. [2021-12-06 18:24:15,005 INFO L78 Accepts]: Start accepts. Automaton has 18625 states and 22747 transitions. Word has length 433 [2021-12-06 18:24:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:24:15,005 INFO L470 AbstractCegarLoop]: Abstraction has 18625 states and 22747 transitions. [2021-12-06 18:24:15,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.8) internal successors, (316), 17 states have internal predecessors, (316), 7 states have call successors, (93), 7 states have call predecessors, (93), 9 states have return successors, (92), 9 states have call predecessors, (92), 7 states have call successors, (92) [2021-12-06 18:24:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18625 states and 22747 transitions. [2021-12-06 18:24:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-12-06 18:24:15,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:24:15,016 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 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, 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] [2021-12-06 18:24:15,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-12-06 18:24:15,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-12-06 18:24:15,218 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:24:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:24:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1276214479, now seen corresponding path program 1 times [2021-12-06 18:24:15,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:24:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350392131] [2021-12-06 18:24:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:24:15,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:24:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:24:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:24:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:24:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:24:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:24:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:24:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:24:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:24:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:24:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:24:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:24:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:24:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:24:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:24:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:24:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:24:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-06 18:24:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2021-12-06 18:24:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:24:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:24:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-06 18:24:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:24:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:24:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:24:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:24:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:24:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:24:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:24:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:24:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-12-06 18:24:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-06 18:24:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-06 18:24:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:24:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:24:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:24:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:24:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-06 18:24:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2021-12-06 18:24:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2021-12-06 18:24:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2021-12-06 18:24:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-06 18:24:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2021-12-06 18:24:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2021-12-06 18:24:15,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:24:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350392131] [2021-12-06 18:24:15,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350392131] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:24:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528069046] [2021-12-06 18:24:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:24:15,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:24:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:24:15,375 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:24:15,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-06 18:24:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:24:15,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-06 18:24:15,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:24:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2021-12-06 18:24:15,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:24:15,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528069046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:24:15,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:24:15,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2021-12-06 18:24:15,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359629438] [2021-12-06 18:24:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:24:15,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:24:15,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:24:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:24:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:24:15,760 INFO L87 Difference]: Start difference. First operand 18625 states and 22747 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-06 18:24:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:24:25,602 INFO L93 Difference]: Finished difference Result 42202 states and 52766 transitions. [2021-12-06 18:24:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:24:25,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 437 [2021-12-06 18:24:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:24:25,640 INFO L225 Difference]: With dead ends: 42202 [2021-12-06 18:24:25,640 INFO L226 Difference]: Without dead ends: 24251 [2021-12-06 18:24:25,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-06 18:24:25,656 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 607 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:24:25,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 1801 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:24:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24251 states. [2021-12-06 18:24:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24251 to 18046. [2021-12-06 18:24:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18046 states, 14179 states have (on average 1.2026941251146062) internal successors, (17053), 14470 states have internal predecessors, (17053), 2394 states have call successors, (2394), 1472 states have call predecessors, (2394), 1472 states have return successors, (2394), 2103 states have call predecessors, (2394), 2394 states have call successors, (2394) [2021-12-06 18:24:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18046 states to 18046 states and 21841 transitions. [2021-12-06 18:24:31,447 INFO L78 Accepts]: Start accepts. Automaton has 18046 states and 21841 transitions. Word has length 437 [2021-12-06 18:24:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:24:31,448 INFO L470 AbstractCegarLoop]: Abstraction has 18046 states and 21841 transitions. [2021-12-06 18:24:31,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-06 18:24:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18046 states and 21841 transitions. [2021-12-06 18:24:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2021-12-06 18:24:31,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:24:31,458 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:24:31,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-12-06 18:24:31,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-12-06 18:24:31,660 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:24:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:24:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1848970847, now seen corresponding path program 1 times [2021-12-06 18:24:31,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:24:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560645789] [2021-12-06 18:24:31,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:24:31,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:24:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:24:31,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 18:24:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:24:31,914 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 18:24:31,914 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 18:24:31,915 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 18:24:31,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-12-06 18:24:31,918 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] [2021-12-06 18:24:31,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 18:24:32,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:24:32 BoogieIcfgContainer [2021-12-06 18:24:32,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 18:24:32,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 18:24:32,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 18:24:32,093 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 18:24:32,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:18" (3/4) ... [2021-12-06 18:24:32,094 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 18:24:32,270 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 18:24:32,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 18:24:32,271 INFO L158 Benchmark]: Toolchain (without parser) took 314930.38ms. Allocated memory was 127.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 90.0MB in the beginning and 787.8MB in the end (delta: -697.9MB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-12-06 18:24:32,271 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 18:24:32,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.11ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 74.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 18:24:32,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 127.9MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 18:24:32,272 INFO L158 Benchmark]: Boogie Preprocessor took 41.98ms. Allocated memory is still 127.9MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 18:24:32,272 INFO L158 Benchmark]: RCFGBuilder took 523.52ms. Allocated memory is still 127.9MB. Free memory was 69.3MB in the beginning and 99.4MB in the end (delta: -30.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2021-12-06 18:24:32,272 INFO L158 Benchmark]: TraceAbstraction took 313828.19ms. Allocated memory was 127.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 98.7MB in the beginning and 856.0MB in the end (delta: -757.3MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2021-12-06 18:24:32,272 INFO L158 Benchmark]: Witness Printer took 178.02ms. Allocated memory is still 2.6GB. Free memory was 856.0MB in the beginning and 787.8MB in the end (delta: 68.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2021-12-06 18:24:32,273 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.14ms. Allocated memory is still 127.9MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.11ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 74.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 127.9MB. Free memory was 74.6MB in the beginning and 71.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.98ms. Allocated memory is still 127.9MB. Free memory was 71.7MB in the beginning and 69.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.52ms. Allocated memory is still 127.9MB. Free memory was 69.3MB in the beginning and 99.4MB in the end (delta: -30.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 313828.19ms. Allocated memory was 127.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 98.7MB in the beginning and 856.0MB in the end (delta: -757.3MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 178.02ms. Allocated memory is still 2.6GB. Free memory was 856.0MB in the beginning and 787.8MB in the end (delta: 68.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 537]: 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 ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] 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] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] 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] [L212] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L75] 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] [L76] 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] [L129] 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] [L130] COND TRUE historyIndex == 0 [L131] 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] [L76] 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] [L76] tmp = (int )read_history_bool(0, 0) [L77] 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] [L99] 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] [L74] 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] [L101] 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] [L212] 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] [L212] tmp = add_history_type(0) [L213] 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] [L216] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L82] 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] [L129] 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] [L139] 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] [L140] COND TRUE historyIndex == 0 [L141] 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] [L82] 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] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] 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] [L99] 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] [L74] 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] [L101] 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] [L216] 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] [L216] tmp___0 = add_history_type(1) [L217] 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] [L220] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L88] 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] [L129] 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] [L139] 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] [L149] 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] [L150] COND TRUE historyIndex == 0 [L151] 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] [L88] 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] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] 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] [L99] 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] [L74] 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] [L101] 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] [L220] 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] [L220] tmp___1 = add_history_type(2) [L221] 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] [L224] 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] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L75] 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] [L81] 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] [L87] 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] [L93] 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] [L94] 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] [L109] 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] [L110] COND TRUE historyIndex == 0 [L111] 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] [L94] 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] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] 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] [L99] 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] [L74] 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] [L101] 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] [L224] 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] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] 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] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [\old(cond)=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, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(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] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] 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] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \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)=3, \old(gate3Failed_History_2)=4, \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=7, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \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)=3, \old(gate3Failed_History_2)=4, \old(history_id)=0, buf=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_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L349] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L380] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=4, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=4, \old(history_id)=2, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=0, 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] [L409] RET write_history_bool(2, gate3Failed) 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, 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] [L416] COND TRUE (int )next_state == 0 [L417] 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, 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] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] RET assume_abort_if_not((_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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, 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] [L428] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND FALSE !(! 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L258] COND TRUE ! gate3Failed [L259] tmp = 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET assume_abort_if_not((_Bool )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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L133] COND TRUE historyIndex == 1 [L134] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L264] RET, EXPR read_history_bool(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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L266] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L139] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L143] COND TRUE historyIndex == 1 [L144] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L266] RET, EXPR read_history_bool(1, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L268] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L139] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L149] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L153] COND TRUE historyIndex == 1 [L154] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L268] RET, EXPR read_history_bool(2, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L271] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L271] RET, EXPR read_history_int8(3, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L275] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L275] RET, EXPR read_history_int8(3, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L279] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L279] RET, EXPR read_history_int8(3, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L297] COND FALSE !(! (temp_count > 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L303] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L113] COND TRUE historyIndex == 1 [L114] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L303] RET, EXPR read_history_int8(3, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L323] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L110] COND TRUE historyIndex == 0 [L111] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L323] RET, EXPR read_history_int8(3, 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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L336] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L535] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L524] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \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=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L347] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L354] COND TRUE (int )next_state == 0 [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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [\old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] RET assume_abort_if_not((_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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L366] 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L380] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, 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] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, 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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L409] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L410] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L411] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [\old(cond)=1, cond=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET assume_abort_if_not((_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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [\old(history_id)=3, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] RET, EXPR read_history_int8(3, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] RET, EXPR check() [L523] c1 = check() [L524] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L537] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 187 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 313.6s, OverallIterations: 59, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 227.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34521 SdHoareTripleChecker+Valid, 56.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33629 mSDsluCounter, 178583 SdHoareTripleChecker+Invalid, 47.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152778 mSDsCounter, 20546 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142509 IncrementalHoareTripleChecker+Invalid, 163055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20546 mSolverCounterUnsat, 25805 mSDtfsCounter, 142509 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19922 GetRequests, 17491 SyntacticMatches, 7 SemanticMatches, 2424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269440 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18625occurred in iteration=57, InterpolantAutomatonStates: 2005, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 317912 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 23246 NumberOfCodeBlocks, 23246 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 26045 ConstructedInterpolants, 0 QuantifiedInterpolants, 54857 SizeOfPredicates, 83 NumberOfNonLiveVariables, 24673 ConjunctsInSsa, 409 ConjunctsInUnsatCore, 91 InterpolantComputations, 44 PerfectInterpolantSequences, 65200/67689 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 18:24:32,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeb30431-4db4-4e21-b835-2c54fee317b1/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