./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 cd644e052c5fe97dcb81eaf801efd62d566cdd8d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:15:30,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:15:30,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:15:30,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:15:30,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:15:30,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:15:30,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:15:30,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:15:30,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:15:30,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:15:30,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:15:30,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:15:30,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:15:30,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:15:30,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:15:30,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:15:30,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:15:30,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:15:30,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:15:30,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:15:30,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:15:30,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:15:30,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:15:30,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:15:30,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:15:30,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:15:30,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:15:30,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:15:30,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:15:30,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:15:30,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:15:30,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:15:30,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:15:30,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:15:30,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:15:30,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:15:30,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:15:30,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:15:30,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:15:30,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:15:30,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:15:30,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:15:30,688 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:15:30,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:15:30,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:15:30,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:15:30,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:15:30,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:15:30,691 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:15:30,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:15:30,692 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:15:30,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:15:30,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:15:30,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:15:30,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:15:30,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:15:30,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:15:30,694 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:15:30,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:15:30,694 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:15:30,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:15:30,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:15:30,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:15:30,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:15:30,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:15:30,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:15:30,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:15:30,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:15:30,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:15:30,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:15:30,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:15:30,696 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:15:30,696 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> cd644e052c5fe97dcb81eaf801efd62d566cdd8d [2021-08-26 09:15:31,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:15:31,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:15:31,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:15:31,039 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:15:31,039 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:15:31,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-08-26 09:15:31,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f66f150/96d6e59b5fe74e2180a38f4b21bbbcf1/FLAGb122aa6ba [2021-08-26 09:15:31,623 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:15:31,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-08-26 09:15:31,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f66f150/96d6e59b5fe74e2180a38f4b21bbbcf1/FLAGb122aa6ba [2021-08-26 09:15:31,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f66f150/96d6e59b5fe74e2180a38f4b21bbbcf1 [2021-08-26 09:15:31,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:15:31,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:15:31,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:15:31,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:15:31,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:15:31,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:31" (1/1) ... [2021-08-26 09:15:31,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294c9a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:31, skipping insertion in model container [2021-08-26 09:15:31,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:31" (1/1) ... [2021-08-26 09:15:32,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:15:32,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:15:32,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12156,12169] [2021-08-26 09:15:32,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:15:32,219 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:15:32,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12156,12169] [2021-08-26 09:15:32,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:15:32,312 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:15:32,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32 WrapperNode [2021-08-26 09:15:32,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:15:32,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:15:32,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:15:32,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:15:32,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:15:32,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:15:32,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:15:32,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:15:32,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:15:32,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:15:32,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:15:32,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:15:32,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (1/1) ... [2021-08-26 09:15:32,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:15:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:32,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 09:15:32,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 09:15:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:15:32,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:15:32,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:15:32,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:15:33,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:15:33,979 INFO L299 CfgBuilder]: Removed 183 assume(true) statements. [2021-08-26 09:15:33,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:33 BoogieIcfgContainer [2021-08-26 09:15:33,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:15:33,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:15:33,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:15:33,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:15:33,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:15:31" (1/3) ... [2021-08-26 09:15:33,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225eef8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:33, skipping insertion in model container [2021-08-26 09:15:33,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:32" (2/3) ... [2021-08-26 09:15:33,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225eef8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:33, skipping insertion in model container [2021-08-26 09:15:33,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:33" (3/3) ... [2021-08-26 09:15:33,988 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2021-08-26 09:15:33,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:15:33,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2021-08-26 09:15:34,043 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:15:34,052 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 09:15:34,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-08-26 09:15:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 09:15:34,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:34,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:34,090 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash 595705480, now seen corresponding path program 1 times [2021-08-26 09:15:34,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:34,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771242896] [2021-08-26 09:15:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:34,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:34,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:34,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771242896] [2021-08-26 09:15:34,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771242896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:34,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:34,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:34,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529308672] [2021-08-26 09:15:34,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:34,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,288 INFO L87 Difference]: Start difference. First operand has 521 states, 483 states have (on average 1.7971014492753623) internal successors, (868), 520 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:34,522 INFO L93 Difference]: Finished difference Result 1245 states and 2060 transitions. [2021-08-26 09:15:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-26 09:15:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:34,544 INFO L225 Difference]: With dead ends: 1245 [2021-08-26 09:15:34,544 INFO L226 Difference]: Without dead ends: 726 [2021-08-26 09:15:34,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-08-26 09:15:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 457. [2021-08-26 09:15:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.6713615023474178) internal successors, (712), 456 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 712 transitions. [2021-08-26 09:15:34,635 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 712 transitions. Word has length 9 [2021-08-26 09:15:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:34,636 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 712 transitions. [2021-08-26 09:15:34,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 712 transitions. [2021-08-26 09:15:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 09:15:34,638 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:34,638 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:34,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:15:34,639 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash -503954138, now seen corresponding path program 1 times [2021-08-26 09:15:34,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:34,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752879517] [2021-08-26 09:15:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:34,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:34,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:34,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752879517] [2021-08-26 09:15:34,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752879517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:34,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:34,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:34,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540574322] [2021-08-26 09:15:34,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:34,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,736 INFO L87 Difference]: Start difference. First operand 457 states and 712 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:34,806 INFO L93 Difference]: Finished difference Result 1131 states and 1746 transitions. [2021-08-26 09:15:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 09:15:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:34,810 INFO L225 Difference]: With dead ends: 1131 [2021-08-26 09:15:34,811 INFO L226 Difference]: Without dead ends: 676 [2021-08-26 09:15:34,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-08-26 09:15:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 424. [2021-08-26 09:15:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 396 states have (on average 1.6515151515151516) internal successors, (654), 423 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 654 transitions. [2021-08-26 09:15:34,824 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 654 transitions. Word has length 10 [2021-08-26 09:15:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:34,824 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 654 transitions. [2021-08-26 09:15:34,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 654 transitions. [2021-08-26 09:15:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 09:15:34,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:34,826 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:34,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:15:34,826 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash -248055967, now seen corresponding path program 1 times [2021-08-26 09:15:34,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:34,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515357961] [2021-08-26 09:15:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:34,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:34,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:34,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515357961] [2021-08-26 09:15:34,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515357961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:34,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:34,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:34,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898480558] [2021-08-26 09:15:34,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:34,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:34,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,894 INFO L87 Difference]: Start difference. First operand 424 states and 654 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:34,943 INFO L93 Difference]: Finished difference Result 1250 states and 1933 transitions. [2021-08-26 09:15:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 09:15:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:34,955 INFO L225 Difference]: With dead ends: 1250 [2021-08-26 09:15:34,956 INFO L226 Difference]: Without dead ends: 836 [2021-08-26 09:15:34,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-08-26 09:15:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 428. [2021-08-26 09:15:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.645) internal successors, (658), 427 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 658 transitions. [2021-08-26 09:15:34,972 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 658 transitions. Word has length 14 [2021-08-26 09:15:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:34,972 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 658 transitions. [2021-08-26 09:15:34,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 658 transitions. [2021-08-26 09:15:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 09:15:34,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:34,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:34,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:15:34,977 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash -35486156, now seen corresponding path program 1 times [2021-08-26 09:15:34,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:34,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909878090] [2021-08-26 09:15:34,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:34,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:35,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:35,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909878090] [2021-08-26 09:15:35,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909878090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:35,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:35,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:35,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286609742] [2021-08-26 09:15:35,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:35,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:35,032 INFO L87 Difference]: Start difference. First operand 428 states and 658 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:35,107 INFO L93 Difference]: Finished difference Result 1579 states and 2407 transitions. [2021-08-26 09:15:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:15:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 09:15:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:35,113 INFO L225 Difference]: With dead ends: 1579 [2021-08-26 09:15:35,113 INFO L226 Difference]: Without dead ends: 1165 [2021-08-26 09:15:35,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-08-26 09:15:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 430. [2021-08-26 09:15:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 402 states have (on average 1.6417910447761195) internal successors, (660), 429 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 660 transitions. [2021-08-26 09:15:35,148 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 660 transitions. Word has length 18 [2021-08-26 09:15:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:35,148 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 660 transitions. [2021-08-26 09:15:35,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 660 transitions. [2021-08-26 09:15:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 09:15:35,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:35,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:35,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:15:35,150 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1707916525, now seen corresponding path program 1 times [2021-08-26 09:15:35,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:35,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574918609] [2021-08-26 09:15:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:35,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:35,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:35,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574918609] [2021-08-26 09:15:35,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574918609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:35,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:35,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:35,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446355762] [2021-08-26 09:15:35,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:35,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:35,192 INFO L87 Difference]: Start difference. First operand 430 states and 660 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:35,230 INFO L93 Difference]: Finished difference Result 673 states and 1026 transitions. [2021-08-26 09:15:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 09:15:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:35,232 INFO L225 Difference]: With dead ends: 673 [2021-08-26 09:15:35,233 INFO L226 Difference]: Without dead ends: 428 [2021-08-26 09:15:35,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-26 09:15:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-08-26 09:15:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 400 states have (on average 1.6325) internal successors, (653), 427 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 653 transitions. [2021-08-26 09:15:35,243 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 653 transitions. Word has length 19 [2021-08-26 09:15:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:35,244 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 653 transitions. [2021-08-26 09:15:35,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 653 transitions. [2021-08-26 09:15:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 09:15:35,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:35,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:35,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:15:35,245 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1967275947, now seen corresponding path program 1 times [2021-08-26 09:15:35,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:35,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749159614] [2021-08-26 09:15:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:35,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:35,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:35,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749159614] [2021-08-26 09:15:35,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749159614] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:35,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050047362] [2021-08-26 09:15:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:35,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:35,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 09:15:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:35,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 09:15:35,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:15:35,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050047362] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:35,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:35,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 09:15:35,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519473364] [2021-08-26 09:15:35,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:15:35,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:15:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:35,664 INFO L87 Difference]: Start difference. First operand 428 states and 653 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:35,797 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2021-08-26 09:15:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:35,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 09:15:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:35,803 INFO L225 Difference]: With dead ends: 1667 [2021-08-26 09:15:35,803 INFO L226 Difference]: Without dead ends: 1250 [2021-08-26 09:15:35,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-08-26 09:15:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 574. [2021-08-26 09:15:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 546 states have (on average 1.6538461538461537) internal successors, (903), 573 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 903 transitions. [2021-08-26 09:15:35,825 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 903 transitions. Word has length 21 [2021-08-26 09:15:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:35,825 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 903 transitions. [2021-08-26 09:15:35,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 903 transitions. [2021-08-26 09:15:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 09:15:35,826 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:35,826 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:35,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:36,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-26 09:15:36,041 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1165168607, now seen corresponding path program 2 times [2021-08-26 09:15:36,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592467216] [2021-08-26 09:15:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:15:36,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592467216] [2021-08-26 09:15:36,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592467216] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533328868] [2021-08-26 09:15:36,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,111 INFO L87 Difference]: Start difference. First operand 574 states and 903 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,220 INFO L93 Difference]: Finished difference Result 1297 states and 2010 transitions. [2021-08-26 09:15:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-26 09:15:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,225 INFO L225 Difference]: With dead ends: 1297 [2021-08-26 09:15:36,225 INFO L226 Difference]: Without dead ends: 781 [2021-08-26 09:15:36,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-08-26 09:15:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 508. [2021-08-26 09:15:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.6041237113402063) internal successors, (778), 507 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 778 transitions. [2021-08-26 09:15:36,243 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 778 transitions. Word has length 28 [2021-08-26 09:15:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,243 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 778 transitions. [2021-08-26 09:15:36,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 778 transitions. [2021-08-26 09:15:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 09:15:36,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,245 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:36,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:15:36,245 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash 777427029, now seen corresponding path program 1 times [2021-08-26 09:15:36,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136955979] [2021-08-26 09:15:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:15:36,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136955979] [2021-08-26 09:15:36,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136955979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515683335] [2021-08-26 09:15:36,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,306 INFO L87 Difference]: Start difference. First operand 508 states and 778 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,353 INFO L93 Difference]: Finished difference Result 1165 states and 1769 transitions. [2021-08-26 09:15:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-26 09:15:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,357 INFO L225 Difference]: With dead ends: 1165 [2021-08-26 09:15:36,357 INFO L226 Difference]: Without dead ends: 688 [2021-08-26 09:15:36,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-08-26 09:15:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 457. [2021-08-26 09:15:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5688073394495412) internal successors, (684), 456 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 684 transitions. [2021-08-26 09:15:36,369 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 684 transitions. Word has length 28 [2021-08-26 09:15:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,369 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 684 transitions. [2021-08-26 09:15:36,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 684 transitions. [2021-08-26 09:15:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 09:15:36,371 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,371 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:15:36,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:15:36,371 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,372 INFO L82 PathProgramCache]: Analyzing trace with hash 104948594, now seen corresponding path program 1 times [2021-08-26 09:15:36,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502691575] [2021-08-26 09:15:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:15:36,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502691575] [2021-08-26 09:15:36,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502691575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:36,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631757203] [2021-08-26 09:15:36,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:36,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:36,411 INFO L87 Difference]: Start difference. First operand 457 states and 684 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,457 INFO L93 Difference]: Finished difference Result 1099 states and 1650 transitions. [2021-08-26 09:15:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-26 09:15:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,461 INFO L225 Difference]: With dead ends: 1099 [2021-08-26 09:15:36,461 INFO L226 Difference]: Without dead ends: 686 [2021-08-26 09:15:36,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-08-26 09:15:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 457. [2021-08-26 09:15:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.5642201834862386) internal successors, (682), 456 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 682 transitions. [2021-08-26 09:15:36,475 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 682 transitions. Word has length 38 [2021-08-26 09:15:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,475 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 682 transitions. [2021-08-26 09:15:36,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 682 transitions. [2021-08-26 09:15:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-26 09:15:36,481 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,481 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:15:36,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:15:36,482 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1338937392, now seen corresponding path program 1 times [2021-08-26 09:15:36,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748847] [2021-08-26 09:15:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 09:15:36,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748847] [2021-08-26 09:15:36,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558503393] [2021-08-26 09:15:36,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,519 INFO L87 Difference]: Start difference. First operand 457 states and 682 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,558 INFO L93 Difference]: Finished difference Result 1035 states and 1549 transitions. [2021-08-26 09:15:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-08-26 09:15:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,561 INFO L225 Difference]: With dead ends: 1035 [2021-08-26 09:15:36,561 INFO L226 Difference]: Without dead ends: 641 [2021-08-26 09:15:36,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-08-26 09:15:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 413. [2021-08-26 09:15:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 393 states have (on average 1.5470737913486006) internal successors, (608), 412 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 608 transitions. [2021-08-26 09:15:36,572 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 608 transitions. Word has length 50 [2021-08-26 09:15:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,573 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 608 transitions. [2021-08-26 09:15:36,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2021-08-26 09:15:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 09:15:36,573 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,574 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:15:36,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:15:36,574 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 970476669, now seen corresponding path program 1 times [2021-08-26 09:15:36,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477836581] [2021-08-26 09:15:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 09:15:36,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477836581] [2021-08-26 09:15:36,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477836581] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917254445] [2021-08-26 09:15:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,610 INFO L87 Difference]: Start difference. First operand 413 states and 608 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,667 INFO L93 Difference]: Finished difference Result 869 states and 1278 transitions. [2021-08-26 09:15:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-26 09:15:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,670 INFO L225 Difference]: With dead ends: 869 [2021-08-26 09:15:36,670 INFO L226 Difference]: Without dead ends: 511 [2021-08-26 09:15:36,671 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-08-26 09:15:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2021-08-26 09:15:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4730878186968839) internal successors, (520), 368 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 520 transitions. [2021-08-26 09:15:36,681 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 520 transitions. Word has length 51 [2021-08-26 09:15:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,681 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 520 transitions. [2021-08-26 09:15:36,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 520 transitions. [2021-08-26 09:15:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 09:15:36,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,682 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-26 09:15:36,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:15:36,683 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash 216341264, now seen corresponding path program 1 times [2021-08-26 09:15:36,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547108395] [2021-08-26 09:15:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 09:15:36,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547108395] [2021-08-26 09:15:36,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547108395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:36,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822330218] [2021-08-26 09:15:36,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:36,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:36,726 INFO L87 Difference]: Start difference. First operand 369 states and 520 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,763 INFO L93 Difference]: Finished difference Result 877 states and 1257 transitions. [2021-08-26 09:15:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-26 09:15:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,766 INFO L225 Difference]: With dead ends: 877 [2021-08-26 09:15:36,767 INFO L226 Difference]: Without dead ends: 580 [2021-08-26 09:15:36,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-08-26 09:15:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 369. [2021-08-26 09:15:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 353 states have (on average 1.4674220963172804) internal successors, (518), 368 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 518 transitions. [2021-08-26 09:15:36,776 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 518 transitions. Word has length 62 [2021-08-26 09:15:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,777 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 518 transitions. [2021-08-26 09:15:36,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 518 transitions. [2021-08-26 09:15:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-26 09:15:36,778 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,778 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-08-26 09:15:36,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:15:36,778 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash 542276843, now seen corresponding path program 1 times [2021-08-26 09:15:36,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293968651] [2021-08-26 09:15:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-26 09:15:36,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293968651] [2021-08-26 09:15:36,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293968651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125252697] [2021-08-26 09:15:36,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,824 INFO L87 Difference]: Start difference. First operand 369 states and 518 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,864 INFO L93 Difference]: Finished difference Result 728 states and 1056 transitions. [2021-08-26 09:15:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-26 09:15:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,867 INFO L225 Difference]: With dead ends: 728 [2021-08-26 09:15:36,867 INFO L226 Difference]: Without dead ends: 465 [2021-08-26 09:15:36,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-08-26 09:15:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 327. [2021-08-26 09:15:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 321 states have (on average 1.4454828660436136) internal successors, (464), 326 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 464 transitions. [2021-08-26 09:15:36,878 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 464 transitions. Word has length 76 [2021-08-26 09:15:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,878 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 464 transitions. [2021-08-26 09:15:36,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 464 transitions. [2021-08-26 09:15:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-26 09:15:36,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,880 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-08-26 09:15:36,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:15:36,880 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash -532838176, now seen corresponding path program 1 times [2021-08-26 09:15:36,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372532879] [2021-08-26 09:15:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-26 09:15:36,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372532879] [2021-08-26 09:15:36,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372532879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:36,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666570044] [2021-08-26 09:15:36,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:36,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:36,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,920 INFO L87 Difference]: Start difference. First operand 327 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:36,943 INFO L93 Difference]: Finished difference Result 516 states and 747 transitions. [2021-08-26 09:15:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-26 09:15:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:36,945 INFO L225 Difference]: With dead ends: 516 [2021-08-26 09:15:36,945 INFO L226 Difference]: Without dead ends: 273 [2021-08-26 09:15:36,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-26 09:15:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-08-26 09:15:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4269662921348314) internal successors, (381), 272 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 381 transitions. [2021-08-26 09:15:36,952 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 381 transitions. Word has length 85 [2021-08-26 09:15:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:36,953 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 381 transitions. [2021-08-26 09:15:36,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 381 transitions. [2021-08-26 09:15:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-26 09:15:36,953 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:36,954 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-08-26 09:15:36,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:15:36,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1722161102, now seen corresponding path program 1 times [2021-08-26 09:15:36,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:36,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713237356] [2021-08-26 09:15:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:36,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-26 09:15:36,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:36,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713237356] [2021-08-26 09:15:36,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713237356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:36,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:36,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:36,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087720445] [2021-08-26 09:15:36,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:36,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:36,997 INFO L87 Difference]: Start difference. First operand 273 states and 381 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,024 INFO L93 Difference]: Finished difference Result 448 states and 642 transitions. [2021-08-26 09:15:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-26 09:15:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,026 INFO L225 Difference]: With dead ends: 448 [2021-08-26 09:15:37,026 INFO L226 Difference]: Without dead ends: 273 [2021-08-26 09:15:37,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-26 09:15:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-08-26 09:15:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.4194756554307115) internal successors, (379), 272 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 379 transitions. [2021-08-26 09:15:37,034 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 379 transitions. Word has length 88 [2021-08-26 09:15:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:37,035 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 379 transitions. [2021-08-26 09:15:37,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 379 transitions. [2021-08-26 09:15:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-26 09:15:37,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:37,036 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-26 09:15:37,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:15:37,036 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 621115599, now seen corresponding path program 1 times [2021-08-26 09:15:37,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:37,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094408888] [2021-08-26 09:15:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-26 09:15:37,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:37,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094408888] [2021-08-26 09:15:37,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094408888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:37,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:37,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:37,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855244778] [2021-08-26 09:15:37,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:37,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,077 INFO L87 Difference]: Start difference. First operand 273 states and 379 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,103 INFO L93 Difference]: Finished difference Result 579 states and 841 transitions. [2021-08-26 09:15:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:37,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-26 09:15:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,106 INFO L225 Difference]: With dead ends: 579 [2021-08-26 09:15:37,106 INFO L226 Difference]: Without dead ends: 409 [2021-08-26 09:15:37,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-08-26 09:15:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2021-08-26 09:15:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4106463878326996) internal successors, (371), 267 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 371 transitions. [2021-08-26 09:15:37,115 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 371 transitions. Word has length 101 [2021-08-26 09:15:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:37,116 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 371 transitions. [2021-08-26 09:15:37,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 371 transitions. [2021-08-26 09:15:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-26 09:15:37,117 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:37,117 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-26 09:15:37,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 09:15:37,117 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2032967497, now seen corresponding path program 1 times [2021-08-26 09:15:37,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:37,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705661721] [2021-08-26 09:15:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-26 09:15:37,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:37,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705661721] [2021-08-26 09:15:37,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705661721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:37,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:37,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:37,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345517052] [2021-08-26 09:15:37,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:37,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,186 INFO L87 Difference]: Start difference. First operand 268 states and 371 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,208 INFO L93 Difference]: Finished difference Result 559 states and 811 transitions. [2021-08-26 09:15:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-26 09:15:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,211 INFO L225 Difference]: With dead ends: 559 [2021-08-26 09:15:37,211 INFO L226 Difference]: Without dead ends: 394 [2021-08-26 09:15:37,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-08-26 09:15:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 264. [2021-08-26 09:15:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 260 states have (on average 1.4) internal successors, (364), 263 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 364 transitions. [2021-08-26 09:15:37,221 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 364 transitions. Word has length 106 [2021-08-26 09:15:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:37,221 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 364 transitions. [2021-08-26 09:15:37,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2021-08-26 09:15:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-26 09:15:37,222 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:37,223 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-26 09:15:37,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 09:15:37,223 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1082553381, now seen corresponding path program 1 times [2021-08-26 09:15:37,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:37,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171342562] [2021-08-26 09:15:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-26 09:15:37,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:37,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171342562] [2021-08-26 09:15:37,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171342562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:37,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:37,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:37,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87536749] [2021-08-26 09:15:37,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:37,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,268 INFO L87 Difference]: Start difference. First operand 264 states and 364 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,286 INFO L93 Difference]: Finished difference Result 423 states and 603 transitions. [2021-08-26 09:15:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-08-26 09:15:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,288 INFO L225 Difference]: With dead ends: 423 [2021-08-26 09:15:37,288 INFO L226 Difference]: Without dead ends: 262 [2021-08-26 09:15:37,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-26 09:15:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-08-26 09:15:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 258 states have (on average 1.3875968992248062) internal successors, (358), 260 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 358 transitions. [2021-08-26 09:15:37,296 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 358 transitions. Word has length 112 [2021-08-26 09:15:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:37,296 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 358 transitions. [2021-08-26 09:15:37,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 358 transitions. [2021-08-26 09:15:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-26 09:15:37,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:37,298 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:37,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 09:15:37,298 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1802895144, now seen corresponding path program 1 times [2021-08-26 09:15:37,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:37,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353759748] [2021-08-26 09:15:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-26 09:15:37,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:37,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353759748] [2021-08-26 09:15:37,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353759748] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:37,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:37,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:37,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8059681] [2021-08-26 09:15:37,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:37,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:37,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:37,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,343 INFO L87 Difference]: Start difference. First operand 261 states and 358 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,352 INFO L93 Difference]: Finished difference Result 468 states and 665 transitions. [2021-08-26 09:15:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-08-26 09:15:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,354 INFO L225 Difference]: With dead ends: 468 [2021-08-26 09:15:37,355 INFO L226 Difference]: Without dead ends: 310 [2021-08-26 09:15:37,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-26 09:15:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 258. [2021-08-26 09:15:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 1.3828125) internal successors, (354), 257 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2021-08-26 09:15:37,363 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 119 [2021-08-26 09:15:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:37,364 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2021-08-26 09:15:37,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2021-08-26 09:15:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-26 09:15:37,365 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:37,366 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-26 09:15:37,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 09:15:37,366 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1684200321, now seen corresponding path program 1 times [2021-08-26 09:15:37,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:37,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020838440] [2021-08-26 09:15:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-26 09:15:37,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:37,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020838440] [2021-08-26 09:15:37,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020838440] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:37,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277084653] [2021-08-26 09:15:37,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:37,418 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:37,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:37,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:37,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:15:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:37,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 09:15:37,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-26 09:15:37,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277084653] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:37,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:37,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-26 09:15:37,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402872303] [2021-08-26 09:15:37,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:15:37,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:15:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:15:37,929 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:37,993 INFO L93 Difference]: Finished difference Result 538 states and 737 transitions. [2021-08-26 09:15:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:15:37,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-08-26 09:15:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:37,995 INFO L225 Difference]: With dead ends: 538 [2021-08-26 09:15:37,995 INFO L226 Difference]: Without dead ends: 299 [2021-08-26 09:15:37,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:15:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-26 09:15:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-08-26 09:15:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.3569023569023568) internal successors, (403), 298 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2021-08-26 09:15:38,005 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 122 [2021-08-26 09:15:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:38,006 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2021-08-26 09:15:38,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2021-08-26 09:15:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-26 09:15:38,007 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:38,007 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-08-26 09:15:38,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:38,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-08-26 09:15:38,225 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1291870858, now seen corresponding path program 2 times [2021-08-26 09:15:38,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:38,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629975603] [2021-08-26 09:15:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:38,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:38,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:38,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629975603] [2021-08-26 09:15:38,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629975603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:38,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:38,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:38,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441226032] [2021-08-26 09:15:38,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:38,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:38,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:38,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:38,320 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:38,398 INFO L93 Difference]: Finished difference Result 636 states and 897 transitions. [2021-08-26 09:15:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:15:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-26 09:15:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:38,400 INFO L225 Difference]: With dead ends: 636 [2021-08-26 09:15:38,400 INFO L226 Difference]: Without dead ends: 481 [2021-08-26 09:15:38,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-26 09:15:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 385. [2021-08-26 09:15:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 383 states have (on average 1.370757180156658) internal successors, (525), 384 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 525 transitions. [2021-08-26 09:15:38,414 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 525 transitions. Word has length 159 [2021-08-26 09:15:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:38,414 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 525 transitions. [2021-08-26 09:15:38,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2021-08-26 09:15:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-08-26 09:15:38,416 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:38,416 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:38,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 09:15:38,417 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1937549472, now seen corresponding path program 1 times [2021-08-26 09:15:38,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:38,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407493784] [2021-08-26 09:15:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:38,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:38,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:38,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407493784] [2021-08-26 09:15:38,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407493784] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:38,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:38,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:38,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173344574] [2021-08-26 09:15:38,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:38,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,498 INFO L87 Difference]: Start difference. First operand 385 states and 525 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:38,531 INFO L93 Difference]: Finished difference Result 799 states and 1134 transitions. [2021-08-26 09:15:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2021-08-26 09:15:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:38,534 INFO L225 Difference]: With dead ends: 799 [2021-08-26 09:15:38,534 INFO L226 Difference]: Without dead ends: 599 [2021-08-26 09:15:38,535 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-08-26 09:15:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2021-08-26 09:15:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 457 states have (on average 1.37417943107221) internal successors, (628), 458 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 628 transitions. [2021-08-26 09:15:38,556 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 628 transitions. Word has length 177 [2021-08-26 09:15:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:38,557 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 628 transitions. [2021-08-26 09:15:38,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 628 transitions. [2021-08-26 09:15:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-08-26 09:15:38,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:38,559 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:38,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 09:15:38,559 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash -251982915, now seen corresponding path program 1 times [2021-08-26 09:15:38,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:38,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126317393] [2021-08-26 09:15:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:38,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:38,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:38,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126317393] [2021-08-26 09:15:38,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126317393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:38,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:38,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:38,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594984273] [2021-08-26 09:15:38,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:38,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,627 INFO L87 Difference]: Start difference. First operand 459 states and 628 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:38,662 INFO L93 Difference]: Finished difference Result 955 states and 1354 transitions. [2021-08-26 09:15:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2021-08-26 09:15:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:38,666 INFO L225 Difference]: With dead ends: 955 [2021-08-26 09:15:38,666 INFO L226 Difference]: Without dead ends: 710 [2021-08-26 09:15:38,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-08-26 09:15:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 557. [2021-08-26 09:15:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 1.38018018018018) internal successors, (766), 556 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 766 transitions. [2021-08-26 09:15:38,700 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 766 transitions. Word has length 178 [2021-08-26 09:15:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:38,700 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 766 transitions. [2021-08-26 09:15:38,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 766 transitions. [2021-08-26 09:15:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-08-26 09:15:38,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:38,702 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:38,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 09:15:38,703 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1139374053, now seen corresponding path program 1 times [2021-08-26 09:15:38,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:38,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201678980] [2021-08-26 09:15:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:38,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:38,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:38,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201678980] [2021-08-26 09:15:38,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201678980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:38,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:38,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:38,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853188064] [2021-08-26 09:15:38,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:38,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:38,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:38,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,793 INFO L87 Difference]: Start difference. First operand 557 states and 766 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:38,837 INFO L93 Difference]: Finished difference Result 1135 states and 1616 transitions. [2021-08-26 09:15:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-08-26 09:15:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:38,841 INFO L225 Difference]: With dead ends: 1135 [2021-08-26 09:15:38,841 INFO L226 Difference]: Without dead ends: 824 [2021-08-26 09:15:38,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-08-26 09:15:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 643. [2021-08-26 09:15:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3946957878315132) internal successors, (894), 642 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 894 transitions. [2021-08-26 09:15:38,868 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 894 transitions. Word has length 179 [2021-08-26 09:15:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:38,869 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 894 transitions. [2021-08-26 09:15:38,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 894 transitions. [2021-08-26 09:15:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-08-26 09:15:38,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:38,871 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:38,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 09:15:38,871 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -920519335, now seen corresponding path program 1 times [2021-08-26 09:15:38,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:38,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775744274] [2021-08-26 09:15:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:38,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:38,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:38,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775744274] [2021-08-26 09:15:38,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775744274] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:38,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:38,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:15:38,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913717050] [2021-08-26 09:15:38,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:15:38,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:15:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:38,972 INFO L87 Difference]: Start difference. First operand 643 states and 894 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:39,119 INFO L93 Difference]: Finished difference Result 1287 states and 1778 transitions. [2021-08-26 09:15:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 09:15:39,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-08-26 09:15:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:39,123 INFO L225 Difference]: With dead ends: 1287 [2021-08-26 09:15:39,123 INFO L226 Difference]: Without dead ends: 898 [2021-08-26 09:15:39,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:15:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-08-26 09:15:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 643. [2021-08-26 09:15:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3806552262090483) internal successors, (885), 642 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 885 transitions. [2021-08-26 09:15:39,157 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 885 transitions. Word has length 179 [2021-08-26 09:15:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:39,158 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 885 transitions. [2021-08-26 09:15:39,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 885 transitions. [2021-08-26 09:15:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-08-26 09:15:39,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:39,160 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08-26 09:15:39,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 09:15:39,161 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1340858399, now seen corresponding path program 1 times [2021-08-26 09:15:39,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:39,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135132258] [2021-08-26 09:15:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:39,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:39,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:39,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135132258] [2021-08-26 09:15:39,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135132258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:39,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:39,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:15:39,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638245838] [2021-08-26 09:15:39,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:15:39,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:39,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:15:39,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:39,229 INFO L87 Difference]: Start difference. First operand 643 states and 885 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:39,388 INFO L93 Difference]: Finished difference Result 1519 states and 2130 transitions. [2021-08-26 09:15:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 09:15:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-08-26 09:15:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:39,393 INFO L225 Difference]: With dead ends: 1519 [2021-08-26 09:15:39,394 INFO L226 Difference]: Without dead ends: 1130 [2021-08-26 09:15:39,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 09:15:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-08-26 09:15:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 643. [2021-08-26 09:15:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 641 states have (on average 1.3790951638065523) internal successors, (884), 642 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 884 transitions. [2021-08-26 09:15:39,441 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 884 transitions. Word has length 180 [2021-08-26 09:15:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:39,441 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 884 transitions. [2021-08-26 09:15:39,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 884 transitions. [2021-08-26 09:15:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-08-26 09:15:39,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:39,443 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-08-26 09:15:39,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 09:15:39,444 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1177602269, now seen corresponding path program 1 times [2021-08-26 09:15:39,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:39,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957552740] [2021-08-26 09:15:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:39,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:39,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:39,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957552740] [2021-08-26 09:15:39,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957552740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:39,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:39,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 09:15:39,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206412367] [2021-08-26 09:15:39,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:15:39,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:15:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:15:39,565 INFO L87 Difference]: Start difference. First operand 643 states and 884 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:39,698 INFO L93 Difference]: Finished difference Result 1058 states and 1477 transitions. [2021-08-26 09:15:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 09:15:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2021-08-26 09:15:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:39,702 INFO L225 Difference]: With dead ends: 1058 [2021-08-26 09:15:39,702 INFO L226 Difference]: Without dead ends: 1056 [2021-08-26 09:15:39,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:15:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-08-26 09:15:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 645. [2021-08-26 09:15:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.3779160186625194) internal successors, (886), 644 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 886 transitions. [2021-08-26 09:15:39,746 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 886 transitions. Word has length 181 [2021-08-26 09:15:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:39,746 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 886 transitions. [2021-08-26 09:15:39,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 886 transitions. [2021-08-26 09:15:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-26 09:15:39,748 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:39,748 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-08-26 09:15:39,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-26 09:15:39,749 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1249235817, now seen corresponding path program 1 times [2021-08-26 09:15:39,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:39,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155859095] [2021-08-26 09:15:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:39,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-26 09:15:39,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:39,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155859095] [2021-08-26 09:15:39,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155859095] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:39,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130411196] [2021-08-26 09:15:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:39,893 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:39,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:39,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:15:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:40,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:15:40,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-08-26 09:15:40,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130411196] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:40,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:40,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-08-26 09:15:40,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523575199] [2021-08-26 09:15:40,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 09:15:40,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 09:15:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-26 09:15:40,739 INFO L87 Difference]: Start difference. First operand 645 states and 886 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:41,373 INFO L93 Difference]: Finished difference Result 3897 states and 5558 transitions. [2021-08-26 09:15:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-26 09:15:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-08-26 09:15:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:41,386 INFO L225 Difference]: With dead ends: 3897 [2021-08-26 09:15:41,387 INFO L226 Difference]: Without dead ends: 3506 [2021-08-26 09:15:41,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2021-08-26 09:15:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2021-08-26 09:15:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 871. [2021-08-26 09:15:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3532796317606444) internal successors, (1176), 870 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1176 transitions. [2021-08-26 09:15:41,467 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1176 transitions. Word has length 184 [2021-08-26 09:15:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:41,467 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1176 transitions. [2021-08-26 09:15:41,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1176 transitions. [2021-08-26 09:15:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-08-26 09:15:41,470 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:41,470 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-08-26 09:15:41,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:41,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:41,685 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash -30627861, now seen corresponding path program 1 times [2021-08-26 09:15:41,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:41,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184797115] [2021-08-26 09:15:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:41,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:41,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:41,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184797115] [2021-08-26 09:15:41,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184797115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:41,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:41,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:41,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551753039] [2021-08-26 09:15:41,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:41,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:41,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:41,738 INFO L87 Difference]: Start difference. First operand 871 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:41,859 INFO L93 Difference]: Finished difference Result 1949 states and 2675 transitions. [2021-08-26 09:15:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-08-26 09:15:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:41,865 INFO L225 Difference]: With dead ends: 1949 [2021-08-26 09:15:41,865 INFO L226 Difference]: Without dead ends: 1558 [2021-08-26 09:15:41,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2021-08-26 09:15:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 871. [2021-08-26 09:15:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 869 states have (on average 1.3509781357882624) internal successors, (1174), 870 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1174 transitions. [2021-08-26 09:15:41,916 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1174 transitions. Word has length 184 [2021-08-26 09:15:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:41,917 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1174 transitions. [2021-08-26 09:15:41,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1174 transitions. [2021-08-26 09:15:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-26 09:15:41,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:41,919 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-08-26 09:15:41,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 09:15:41,920 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -489339443, now seen corresponding path program 1 times [2021-08-26 09:15:41,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:41,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605994790] [2021-08-26 09:15:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:41,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-08-26 09:15:41,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:41,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605994790] [2021-08-26 09:15:41,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605994790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:41,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:41,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:41,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85852984] [2021-08-26 09:15:41,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:41,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:41,967 INFO L87 Difference]: Start difference. First operand 871 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:42,026 INFO L93 Difference]: Finished difference Result 1463 states and 1989 transitions. [2021-08-26 09:15:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2021-08-26 09:15:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:42,029 INFO L225 Difference]: With dead ends: 1463 [2021-08-26 09:15:42,030 INFO L226 Difference]: Without dead ends: 713 [2021-08-26 09:15:42,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-08-26 09:15:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2021-08-26 09:15:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 710 states have (on average 1.3253521126760563) internal successors, (941), 711 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 941 transitions. [2021-08-26 09:15:42,087 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 941 transitions. Word has length 187 [2021-08-26 09:15:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:42,087 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 941 transitions. [2021-08-26 09:15:42,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 941 transitions. [2021-08-26 09:15:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-08-26 09:15:42,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:42,089 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:42,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-26 09:15:42,090 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1612175983, now seen corresponding path program 1 times [2021-08-26 09:15:42,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:42,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565758281] [2021-08-26 09:15:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:42,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:42,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:42,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565758281] [2021-08-26 09:15:42,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565758281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:42,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:42,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:15:42,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831275916] [2021-08-26 09:15:42,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:15:42,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:42,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:15:42,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:15:42,234 INFO L87 Difference]: Start difference. First operand 712 states and 941 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:42,539 INFO L93 Difference]: Finished difference Result 1529 states and 2049 transitions. [2021-08-26 09:15:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 09:15:42,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2021-08-26 09:15:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:42,545 INFO L225 Difference]: With dead ends: 1529 [2021-08-26 09:15:42,545 INFO L226 Difference]: Without dead ends: 1149 [2021-08-26 09:15:42,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-26 09:15:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2021-08-26 09:15:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 827. [2021-08-26 09:15:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.3163636363636364) internal successors, (1086), 826 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1086 transitions. [2021-08-26 09:15:42,594 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1086 transitions. Word has length 192 [2021-08-26 09:15:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:42,595 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1086 transitions. [2021-08-26 09:15:42,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1086 transitions. [2021-08-26 09:15:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-08-26 09:15:42,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:42,597 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:42,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-26 09:15:42,598 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1609314537, now seen corresponding path program 1 times [2021-08-26 09:15:42,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:42,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344214205] [2021-08-26 09:15:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:42,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:42,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:42,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344214205] [2021-08-26 09:15:42,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344214205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:42,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:42,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 09:15:42,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229600530] [2021-08-26 09:15:42,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:15:42,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:15:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:15:42,697 INFO L87 Difference]: Start difference. First operand 827 states and 1086 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:42,877 INFO L93 Difference]: Finished difference Result 2702 states and 3678 transitions. [2021-08-26 09:15:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:15:42,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-08-26 09:15:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:42,895 INFO L225 Difference]: With dead ends: 2702 [2021-08-26 09:15:42,895 INFO L226 Difference]: Without dead ends: 2201 [2021-08-26 09:15:42,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:15:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-08-26 09:15:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 904. [2021-08-26 09:15:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.312638580931264) internal successors, (1184), 903 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1184 transitions. [2021-08-26 09:15:42,965 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1184 transitions. Word has length 198 [2021-08-26 09:15:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:42,965 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1184 transitions. [2021-08-26 09:15:42,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1184 transitions. [2021-08-26 09:15:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-08-26 09:15:42,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:42,967 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:42,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-26 09:15:42,968 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1927329879, now seen corresponding path program 1 times [2021-08-26 09:15:42,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:42,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847657615] [2021-08-26 09:15:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:42,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:43,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:43,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847657615] [2021-08-26 09:15:43,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847657615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:43,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:43,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:15:43,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367736105] [2021-08-26 09:15:43,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:15:43,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:15:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:15:43,139 INFO L87 Difference]: Start difference. First operand 904 states and 1184 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:43,582 INFO L93 Difference]: Finished difference Result 2175 states and 2872 transitions. [2021-08-26 09:15:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 09:15:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-08-26 09:15:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:43,594 INFO L225 Difference]: With dead ends: 2175 [2021-08-26 09:15:43,595 INFO L226 Difference]: Without dead ends: 1600 [2021-08-26 09:15:43,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 119.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 09:15:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-08-26 09:15:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 966. [2021-08-26 09:15:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 964 states have (on average 1.3008298755186722) internal successors, (1254), 965 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1254 transitions. [2021-08-26 09:15:43,658 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1254 transitions. Word has length 198 [2021-08-26 09:15:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:43,658 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1254 transitions. [2021-08-26 09:15:43,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1254 transitions. [2021-08-26 09:15:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-08-26 09:15:43,660 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:43,660 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:43,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-26 09:15:43,660 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 645504485, now seen corresponding path program 1 times [2021-08-26 09:15:43,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:43,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470236735] [2021-08-26 09:15:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:43,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:43,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:43,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470236735] [2021-08-26 09:15:43,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470236735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:43,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:43,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:15:43,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648419038] [2021-08-26 09:15:43,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:15:43,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:43,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:15:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:15:43,811 INFO L87 Difference]: Start difference. First operand 966 states and 1254 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:44,164 INFO L93 Difference]: Finished difference Result 2008 states and 2642 transitions. [2021-08-26 09:15:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 09:15:44,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-08-26 09:15:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:44,168 INFO L225 Difference]: With dead ends: 2008 [2021-08-26 09:15:44,168 INFO L226 Difference]: Without dead ends: 1366 [2021-08-26 09:15:44,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 97.3ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-26 09:15:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-08-26 09:15:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 933. [2021-08-26 09:15:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 931 states have (on average 1.3029001074113855) internal successors, (1213), 932 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2021-08-26 09:15:44,226 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 198 [2021-08-26 09:15:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:44,227 INFO L470 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2021-08-26 09:15:44,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2021-08-26 09:15:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-08-26 09:15:44,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:44,229 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:44,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-26 09:15:44,229 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1197921535, now seen corresponding path program 1 times [2021-08-26 09:15:44,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:44,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944621586] [2021-08-26 09:15:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:44,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-08-26 09:15:44,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:44,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944621586] [2021-08-26 09:15:44,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944621586] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:44,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:44,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:15:44,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086139684] [2021-08-26 09:15:44,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:44,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:15:44,291 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:44,460 INFO L93 Difference]: Finished difference Result 1691 states and 2224 transitions. [2021-08-26 09:15:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:15:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2021-08-26 09:15:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:44,470 INFO L225 Difference]: With dead ends: 1691 [2021-08-26 09:15:44,471 INFO L226 Difference]: Without dead ends: 1090 [2021-08-26 09:15:44,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:15:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-08-26 09:15:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 833. [2021-08-26 09:15:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 1.28125) internal successors, (1066), 832 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1066 transitions. [2021-08-26 09:15:44,523 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1066 transitions. Word has length 207 [2021-08-26 09:15:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:44,524 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1066 transitions. [2021-08-26 09:15:44,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1066 transitions. [2021-08-26 09:15:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-26 09:15:44,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:44,526 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:44,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-26 09:15:44,526 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1187317822, now seen corresponding path program 1 times [2021-08-26 09:15:44,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:44,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424473543] [2021-08-26 09:15:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:44,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-08-26 09:15:44,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:44,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424473543] [2021-08-26 09:15:44,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424473543] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:44,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907691285] [2021-08-26 09:15:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:44,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:44,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:44,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 09:15:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:45,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 09:15:45,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-08-26 09:15:45,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907691285] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:45,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:15:45,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2021-08-26 09:15:45,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803732672] [2021-08-26 09:15:45,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:15:45,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:15:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:15:45,854 INFO L87 Difference]: Start difference. First operand 833 states and 1066 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:46,293 INFO L93 Difference]: Finished difference Result 2343 states and 3029 transitions. [2021-08-26 09:15:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 09:15:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-08-26 09:15:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:46,297 INFO L225 Difference]: With dead ends: 2343 [2021-08-26 09:15:46,297 INFO L226 Difference]: Without dead ends: 1842 [2021-08-26 09:15:46,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 198.2ms TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-08-26 09:15:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-08-26 09:15:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 869. [2021-08-26 09:15:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.2799539170506913) internal successors, (1111), 868 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1111 transitions. [2021-08-26 09:15:46,367 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1111 transitions. Word has length 232 [2021-08-26 09:15:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:46,367 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1111 transitions. [2021-08-26 09:15:46,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1111 transitions. [2021-08-26 09:15:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-08-26 09:15:46,370 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:46,370 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:46,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:46,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:46,596 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1244576124, now seen corresponding path program 1 times [2021-08-26 09:15:46,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:46,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568908497] [2021-08-26 09:15:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:46,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-08-26 09:15:46,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:46,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568908497] [2021-08-26 09:15:46,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568908497] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:46,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:15:46,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:15:46,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986791399] [2021-08-26 09:15:46,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:15:46,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:15:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:46,677 INFO L87 Difference]: Start difference. First operand 869 states and 1111 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:46,797 INFO L93 Difference]: Finished difference Result 1689 states and 2151 transitions. [2021-08-26 09:15:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:15:46,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-08-26 09:15:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:46,799 INFO L225 Difference]: With dead ends: 1689 [2021-08-26 09:15:46,799 INFO L226 Difference]: Without dead ends: 1115 [2021-08-26 09:15:46,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:15:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2021-08-26 09:15:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 863. [2021-08-26 09:15:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.2552204176334107) internal successors, (1082), 862 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1082 transitions. [2021-08-26 09:15:46,856 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1082 transitions. Word has length 232 [2021-08-26 09:15:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:46,857 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1082 transitions. [2021-08-26 09:15:46,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1082 transitions. [2021-08-26 09:15:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-08-26 09:15:46,859 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:46,859 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-26 09:15:46,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-26 09:15:46,860 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -836297208, now seen corresponding path program 1 times [2021-08-26 09:15:46,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:46,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246953696] [2021-08-26 09:15:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:46,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:47,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:47,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246953696] [2021-08-26 09:15:47,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246953696] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:47,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048224488] [2021-08-26 09:15:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:47,022 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:47,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:47,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 09:15:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:47,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 09:15:47,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:48,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048224488] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:48,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:48,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-08-26 09:15:48,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194063109] [2021-08-26 09:15:48,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 09:15:48,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 09:15:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:15:48,174 INFO L87 Difference]: Start difference. First operand 863 states and 1082 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:48,994 INFO L93 Difference]: Finished difference Result 3434 states and 4393 transitions. [2021-08-26 09:15:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 09:15:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-08-26 09:15:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:49,000 INFO L225 Difference]: With dead ends: 3434 [2021-08-26 09:15:49,000 INFO L226 Difference]: Without dead ends: 2903 [2021-08-26 09:15:49,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 437.0ms TimeCoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2021-08-26 09:15:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2021-08-26 09:15:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1429. [2021-08-26 09:15:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.2584033613445378) internal successors, (1797), 1428 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1797 transitions. [2021-08-26 09:15:49,130 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1797 transitions. Word has length 238 [2021-08-26 09:15:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:49,130 INFO L470 AbstractCegarLoop]: Abstraction has 1429 states and 1797 transitions. [2021-08-26 09:15:49,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1797 transitions. [2021-08-26 09:15:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-08-26 09:15:49,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:49,144 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:49,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:49,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-26 09:15:49,369 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1012261644, now seen corresponding path program 1 times [2021-08-26 09:15:49,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:49,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80859512] [2021-08-26 09:15:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:49,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:49,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:49,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80859512] [2021-08-26 09:15:49,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80859512] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:49,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689646991] [2021-08-26 09:15:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:49,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:49,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:49,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 09:15:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:50,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 09:15:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:50,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689646991] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:50,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:50,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2021-08-26 09:15:50,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23320209] [2021-08-26 09:15:50,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 09:15:50,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 09:15:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:15:50,924 INFO L87 Difference]: Start difference. First operand 1429 states and 1797 transitions. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:52,003 INFO L93 Difference]: Finished difference Result 7331 states and 9345 transitions. [2021-08-26 09:15:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 09:15:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-08-26 09:15:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:52,021 INFO L225 Difference]: With dead ends: 7331 [2021-08-26 09:15:52,021 INFO L226 Difference]: Without dead ends: 6277 [2021-08-26 09:15:52,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 466.1ms TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-08-26 09:15:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2021-08-26 09:15:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 3475. [2021-08-26 09:15:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3474 states have (on average 1.2377662636729994) internal successors, (4300), 3474 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 4300 transitions. [2021-08-26 09:15:52,349 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 4300 transitions. Word has length 238 [2021-08-26 09:15:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:52,350 INFO L470 AbstractCegarLoop]: Abstraction has 3475 states and 4300 transitions. [2021-08-26 09:15:52,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 4300 transitions. [2021-08-26 09:15:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-08-26 09:15:52,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:52,356 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:15:52,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:52,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-26 09:15:52,582 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1132569626, now seen corresponding path program 1 times [2021-08-26 09:15:52,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:52,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576746191] [2021-08-26 09:15:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:52,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:52,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:52,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576746191] [2021-08-26 09:15:52,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576746191] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:52,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328125238] [2021-08-26 09:15:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:52,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:52,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 09:15:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:53,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 09:15:53,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-26 09:15:54,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328125238] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:15:54,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:15:54,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2021-08-26 09:15:54,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323649193] [2021-08-26 09:15:54,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:15:54,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:15:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2021-08-26 09:15:54,273 INFO L87 Difference]: Start difference. First operand 3475 states and 4300 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:15:54,586 INFO L93 Difference]: Finished difference Result 6552 states and 8126 transitions. [2021-08-26 09:15:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:15:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2021-08-26 09:15:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:15:54,592 INFO L225 Difference]: With dead ends: 6552 [2021-08-26 09:15:54,592 INFO L226 Difference]: Without dead ends: 3365 [2021-08-26 09:15:54,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 262.7ms TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2021-08-26 09:15:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2021-08-26 09:15:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365. [2021-08-26 09:15:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2271105826397146) internal successors, (4128), 3364 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4128 transitions. [2021-08-26 09:15:54,861 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4128 transitions. Word has length 239 [2021-08-26 09:15:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:15:54,861 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4128 transitions. [2021-08-26 09:15:54,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:15:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4128 transitions. [2021-08-26 09:15:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-08-26 09:15:54,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:15:54,867 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:15:54,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 09:15:55,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:55,093 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:15:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:15:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1180183742, now seen corresponding path program 1 times [2021-08-26 09:15:55,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:15:55,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300293819] [2021-08-26 09:15:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:55,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:15:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:15:55,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:15:55,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300293819] [2021-08-26 09:15:55,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300293819] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:55,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95183579] [2021-08-26 09:15:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:15:55,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:15:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:15:55,428 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:15:55,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 09:15:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:15:56,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-26 09:15:56,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:15:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-08-26 09:15:56,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95183579] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:15:56,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:15:56,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2021-08-26 09:15:56,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548949600] [2021-08-26 09:15:56,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-26 09:15:56,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:15:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-26 09:15:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-08-26 09:15:56,991 INFO L87 Difference]: Start difference. First operand 3365 states and 4128 transitions. Second operand has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:04,752 INFO L93 Difference]: Finished difference Result 23508 states and 29620 transitions. [2021-08-26 09:16:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-08-26 09:16:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2021-08-26 09:16:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:04,783 INFO L225 Difference]: With dead ends: 23508 [2021-08-26 09:16:04,784 INFO L226 Difference]: Without dead ends: 20570 [2021-08-26 09:16:04,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8441 ImplicationChecksByTransitivity, 3551.5ms TimeCoverageRelationStatistics Valid=2584, Invalid=23498, Unknown=0, NotChecked=0, Total=26082 [2021-08-26 09:16:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2021-08-26 09:16:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 5159. [2021-08-26 09:16:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5159 states, 5158 states have (on average 1.2194649088794107) internal successors, (6290), 5158 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 6290 transitions. [2021-08-26 09:16:05,317 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 6290 transitions. Word has length 240 [2021-08-26 09:16:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:05,318 INFO L470 AbstractCegarLoop]: Abstraction has 5159 states and 6290 transitions. [2021-08-26 09:16:05,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.571428571428571) internal successors, (324), 28 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 6290 transitions. [2021-08-26 09:16:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-08-26 09:16:05,326 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:05,326 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-26 09:16:05,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-26 09:16:05,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-08-26 09:16:05,551 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash -365509161, now seen corresponding path program 1 times [2021-08-26 09:16:05,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:05,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669359982] [2021-08-26 09:16:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:05,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-26 09:16:05,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:05,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669359982] [2021-08-26 09:16:05,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669359982] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:16:05,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:16:05,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:16:05,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110919079] [2021-08-26 09:16:05,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:16:05,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:16:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:16:05,590 INFO L87 Difference]: Start difference. First operand 5159 states and 6290 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:05,929 INFO L93 Difference]: Finished difference Result 9887 states and 12052 transitions. [2021-08-26 09:16:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:16:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2021-08-26 09:16:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:05,937 INFO L225 Difference]: With dead ends: 9887 [2021-08-26 09:16:05,938 INFO L226 Difference]: Without dead ends: 4741 [2021-08-26 09:16:05,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:16:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2021-08-26 09:16:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4741. [2021-08-26 09:16:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.2168776371308017) internal successors, (5768), 4740 states have internal predecessors, (5768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 5768 transitions. [2021-08-26 09:16:06,383 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 5768 transitions. Word has length 243 [2021-08-26 09:16:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:06,385 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 5768 transitions. [2021-08-26 09:16:06,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 5768 transitions. [2021-08-26 09:16:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-08-26 09:16:06,392 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:06,392 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08-26 09:16:06,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-26 09:16:06,393 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1487829042, now seen corresponding path program 1 times [2021-08-26 09:16:06,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:06,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549362501] [2021-08-26 09:16:06,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:06,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-08-26 09:16:06,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:06,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549362501] [2021-08-26 09:16:06,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549362501] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:16:06,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:16:06,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:16:06,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229732164] [2021-08-26 09:16:06,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:16:06,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:16:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:16:06,509 INFO L87 Difference]: Start difference. First operand 4741 states and 5768 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:06,912 INFO L93 Difference]: Finished difference Result 8885 states and 10825 transitions. [2021-08-26 09:16:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:16:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2021-08-26 09:16:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:06,918 INFO L225 Difference]: With dead ends: 8885 [2021-08-26 09:16:06,918 INFO L226 Difference]: Without dead ends: 4769 [2021-08-26 09:16:06,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.0ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:16:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2021-08-26 09:16:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4762. [2021-08-26 09:16:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4762 states, 4761 states have (on average 1.2157109850871666) internal successors, (5788), 4761 states have internal predecessors, (5788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4762 states to 4762 states and 5788 transitions. [2021-08-26 09:16:07,342 INFO L78 Accepts]: Start accepts. Automaton has 4762 states and 5788 transitions. Word has length 246 [2021-08-26 09:16:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:07,343 INFO L470 AbstractCegarLoop]: Abstraction has 4762 states and 5788 transitions. [2021-08-26 09:16:07,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4762 states and 5788 transitions. [2021-08-26 09:16:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-08-26 09:16:07,351 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:07,351 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:16:07,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-26 09:16:07,351 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash -923801151, now seen corresponding path program 1 times [2021-08-26 09:16:07,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:07,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033100134] [2021-08-26 09:16:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:07,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:16:07,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:07,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033100134] [2021-08-26 09:16:07,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033100134] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:07,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613595886] [2021-08-26 09:16:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:07,674 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:16:07,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:16:07,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:16:07,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 09:16:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:08,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-26 09:16:08,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:16:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-26 09:16:09,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613595886] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:09,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:16:09,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-08-26 09:16:09,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038920572] [2021-08-26 09:16:09,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-26 09:16:09,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-26 09:16:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2021-08-26 09:16:09,950 INFO L87 Difference]: Start difference. First operand 4762 states and 5788 transitions. Second operand has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:25,697 INFO L93 Difference]: Finished difference Result 40803 states and 50962 transitions. [2021-08-26 09:16:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2021-08-26 09:16:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2021-08-26 09:16:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:25,740 INFO L225 Difference]: With dead ends: 40803 [2021-08-26 09:16:25,740 INFO L226 Difference]: Without dead ends: 36683 [2021-08-26 09:16:25,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21753 ImplicationChecksByTransitivity, 7521.8ms TimeCoverageRelationStatistics Valid=6041, Invalid=49419, Unknown=0, NotChecked=0, Total=55460 [2021-08-26 09:16:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2021-08-26 09:16:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 5155. [2021-08-26 09:16:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2180830422972448) internal successors, (6278), 5154 states have internal predecessors, (6278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6278 transitions. [2021-08-26 09:16:26,499 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6278 transitions. Word has length 247 [2021-08-26 09:16:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:26,499 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6278 transitions. [2021-08-26 09:16:26,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 30 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6278 transitions. [2021-08-26 09:16:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-08-26 09:16:26,505 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:26,505 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:16:26,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 09:16:26,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:16:26,706 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1336287465, now seen corresponding path program 1 times [2021-08-26 09:16:26,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:26,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734604272] [2021-08-26 09:16:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:26,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-08-26 09:16:26,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:26,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734604272] [2021-08-26 09:16:26,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734604272] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:16:26,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:16:26,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:16:26,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057618855] [2021-08-26 09:16:26,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:16:26,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:26,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:16:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:16:26,854 INFO L87 Difference]: Start difference. First operand 5155 states and 6278 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:27,446 INFO L93 Difference]: Finished difference Result 9682 states and 11849 transitions. [2021-08-26 09:16:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:16:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-08-26 09:16:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:27,452 INFO L225 Difference]: With dead ends: 9682 [2021-08-26 09:16:27,452 INFO L226 Difference]: Without dead ends: 5155 [2021-08-26 09:16:27,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:16:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2021-08-26 09:16:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5155. [2021-08-26 09:16:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.214396585176562) internal successors, (6259), 5154 states have internal predecessors, (6259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6259 transitions. [2021-08-26 09:16:27,899 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6259 transitions. Word has length 254 [2021-08-26 09:16:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:27,899 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6259 transitions. [2021-08-26 09:16:27,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6259 transitions. [2021-08-26 09:16:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-08-26 09:16:27,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:27,907 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:16:27,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-26 09:16:27,908 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1666210174, now seen corresponding path program 1 times [2021-08-26 09:16:27,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:27,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120310019] [2021-08-26 09:16:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:27,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:16:28,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:28,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120310019] [2021-08-26 09:16:28,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120310019] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:28,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007098012] [2021-08-26 09:16:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:28,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:16:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:16:28,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:16:28,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 09:16:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:29,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 32 conjunts are in the unsatisfiable core [2021-08-26 09:16:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:16:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 38 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-08-26 09:16:30,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007098012] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:30,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:16:30,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2021-08-26 09:16:30,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165995910] [2021-08-26 09:16:30,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-26 09:16:30,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-26 09:16:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2021-08-26 09:16:30,557 INFO L87 Difference]: Start difference. First operand 5155 states and 6259 transitions. Second operand has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:16:41,373 INFO L93 Difference]: Finished difference Result 34391 states and 43026 transitions. [2021-08-26 09:16:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-08-26 09:16:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2021-08-26 09:16:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:16:41,408 INFO L225 Difference]: With dead ends: 34391 [2021-08-26 09:16:41,409 INFO L226 Difference]: Without dead ends: 30122 [2021-08-26 09:16:41,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10072 ImplicationChecksByTransitivity, 4245.7ms TimeCoverageRelationStatistics Valid=2832, Invalid=28320, Unknown=0, NotChecked=0, Total=31152 [2021-08-26 09:16:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30122 states. [2021-08-26 09:16:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30122 to 5155. [2021-08-26 09:16:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 5154 states have (on average 1.2120682964687621) internal successors, (6247), 5154 states have internal predecessors, (6247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6247 transitions. [2021-08-26 09:16:42,021 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6247 transitions. Word has length 254 [2021-08-26 09:16:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:16:42,022 INFO L470 AbstractCegarLoop]: Abstraction has 5155 states and 6247 transitions. [2021-08-26 09:16:42,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.11111111111111) internal successors, (364), 36 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:16:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6247 transitions. [2021-08-26 09:16:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-26 09:16:42,030 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:16:42,031 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:16:42,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-26 09:16:42,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-08-26 09:16:42,237 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:16:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:16:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1107246419, now seen corresponding path program 1 times [2021-08-26 09:16:42,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:16:42,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812568920] [2021-08-26 09:16:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:42,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:16:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:16:42,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:16:42,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812568920] [2021-08-26 09:16:42,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812568920] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:42,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604909464] [2021-08-26 09:16:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:16:42,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:16:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:16:42,611 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:16:42,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-26 09:16:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:16:43,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-26 09:16:43,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:16:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:16:45,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604909464] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:16:45,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:16:45,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2021-08-26 09:16:45,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079846086] [2021-08-26 09:16:45,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-26 09:16:45,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:16:45,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-26 09:16:45,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2021-08-26 09:16:45,171 INFO L87 Difference]: Start difference. First operand 5155 states and 6247 transitions. Second operand has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:17:19,108 INFO L93 Difference]: Finished difference Result 60340 states and 75705 transitions. [2021-08-26 09:17:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2021-08-26 09:17:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-08-26 09:17:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:17:19,185 INFO L225 Difference]: With dead ends: 60340 [2021-08-26 09:17:19,186 INFO L226 Difference]: Without dead ends: 56573 [2021-08-26 09:17:19,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124344 ImplicationChecksByTransitivity, 21105.2ms TimeCoverageRelationStatistics Valid=24889, Invalid=266171, Unknown=0, NotChecked=0, Total=291060 [2021-08-26 09:17:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56573 states. [2021-08-26 09:17:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56573 to 7732. [2021-08-26 09:17:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2392963394127539) internal successors, (9581), 7731 states have internal predecessors, (9581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9581 transitions. [2021-08-26 09:17:20,442 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9581 transitions. Word has length 271 [2021-08-26 09:17:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:17:20,443 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9581 transitions. [2021-08-26 09:17:20,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.176470588235293) internal successors, (380), 33 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9581 transitions. [2021-08-26 09:17:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-26 09:17:20,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:17:20,458 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:17:20,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 09:17:20,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-08-26 09:17:20,668 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:17:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:17:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1536904725, now seen corresponding path program 1 times [2021-08-26 09:17:20,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:17:20,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344759819] [2021-08-26 09:17:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:17:20,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:17:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:17:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-08-26 09:17:20,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:17:20,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344759819] [2021-08-26 09:17:20,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344759819] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:17:20,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:17:20,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:17:20,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271542441] [2021-08-26 09:17:20,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:17:20,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:17:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:17:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:17:20,784 INFO L87 Difference]: Start difference. First operand 7732 states and 9581 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:17:21,828 INFO L93 Difference]: Finished difference Result 14190 states and 17630 transitions. [2021-08-26 09:17:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:17:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-08-26 09:17:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:17:21,847 INFO L225 Difference]: With dead ends: 14190 [2021-08-26 09:17:21,847 INFO L226 Difference]: Without dead ends: 7732 [2021-08-26 09:17:21,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:17:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2021-08-26 09:17:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7732. [2021-08-26 09:17:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 1.2358039063510542) internal successors, (9554), 7731 states have internal predecessors, (9554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 9554 transitions. [2021-08-26 09:17:22,780 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 9554 transitions. Word has length 271 [2021-08-26 09:17:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:17:22,780 INFO L470 AbstractCegarLoop]: Abstraction has 7732 states and 9554 transitions. [2021-08-26 09:17:22,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:17:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 9554 transitions. [2021-08-26 09:17:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-26 09:17:22,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:17:22,790 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:17:22,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-26 09:17:22,790 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:17:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:17:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash -240703937, now seen corresponding path program 1 times [2021-08-26 09:17:22,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:17:22,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767564135] [2021-08-26 09:17:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:17:22,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:17:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:17:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:17:23,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:17:23,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767564135] [2021-08-26 09:17:23,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767564135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:17:23,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836660296] [2021-08-26 09:17:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:17:23,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:17:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:17:23,073 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:17:23,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-26 09:17:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:17:24,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-26 09:17:24,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:17:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:17:25,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836660296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:17:25,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:17:25,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-08-26 09:17:25,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294143320] [2021-08-26 09:17:25,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-26 09:17:25,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:17:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-26 09:17:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-08-26 09:17:25,546 INFO L87 Difference]: Start difference. First operand 7732 states and 9554 transitions. Second operand has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:18:01,295 INFO L93 Difference]: Finished difference Result 122734 states and 155659 transitions. [2021-08-26 09:18:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2021-08-26 09:18:01,296 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-08-26 09:18:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:18:01,483 INFO L225 Difference]: With dead ends: 122734 [2021-08-26 09:18:01,483 INFO L226 Difference]: Without dead ends: 117248 [2021-08-26 09:18:01,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76865 ImplicationChecksByTransitivity, 13501.9ms TimeCoverageRelationStatistics Valid=15860, Invalid=169470, Unknown=0, NotChecked=0, Total=185330 [2021-08-26 09:18:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117248 states. [2021-08-26 09:18:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117248 to 10897. [2021-08-26 09:18:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10897 states, 10896 states have (on average 1.2372430249632893) internal successors, (13481), 10896 states have internal predecessors, (13481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 13481 transitions. [2021-08-26 09:18:03,461 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 13481 transitions. Word has length 271 [2021-08-26 09:18:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:18:03,462 INFO L470 AbstractCegarLoop]: Abstraction has 10897 states and 13481 transitions. [2021-08-26 09:18:03,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.0625) internal successors, (386), 31 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 13481 transitions. [2021-08-26 09:18:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-26 09:18:03,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:18:03,475 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:18:03,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 09:18:03,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-08-26 09:18:03,676 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:18:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:18:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1858144387, now seen corresponding path program 1 times [2021-08-26 09:18:03,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:18:03,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74785880] [2021-08-26 09:18:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:18:03,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:18:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:18:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:18:04,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:18:04,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74785880] [2021-08-26 09:18:04,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74785880] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:18:04,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735579684] [2021-08-26 09:18:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:18:04,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:18:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:18:04,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:18:04,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-26 09:18:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:18:05,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 09:18:05,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:18:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-08-26 09:18:06,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735579684] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:18:06,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:18:06,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 27 [2021-08-26 09:18:06,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975975478] [2021-08-26 09:18:06,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-26 09:18:06,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:18:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-26 09:18:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-08-26 09:18:06,358 INFO L87 Difference]: Start difference. First operand 10897 states and 13481 transitions. Second operand has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:18:17,565 INFO L93 Difference]: Finished difference Result 55046 states and 69950 transitions. [2021-08-26 09:18:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-08-26 09:18:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2021-08-26 09:18:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:18:17,619 INFO L225 Difference]: With dead ends: 55046 [2021-08-26 09:18:17,619 INFO L226 Difference]: Without dead ends: 45210 [2021-08-26 09:18:17,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2001.7ms TimeCoverageRelationStatistics Valid=937, Invalid=7073, Unknown=0, NotChecked=0, Total=8010 [2021-08-26 09:18:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45210 states. [2021-08-26 09:18:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45210 to 10073. [2021-08-26 09:18:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-08-26 09:18:19,268 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 271 [2021-08-26 09:18:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:18:19,268 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-08-26 09:18:19,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.11111111111111) internal successors, (354), 27 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:18:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-08-26 09:18:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-26 09:18:19,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:18:19,276 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:18:19,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-26 09:18:19,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-08-26 09:18:19,476 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:18:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:18:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1031243988, now seen corresponding path program 1 times [2021-08-26 09:18:19,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:18:19,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137933272] [2021-08-26 09:18:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:18:19,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:18:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:18:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:18:19,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:18:19,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137933272] [2021-08-26 09:18:19,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137933272] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:18:19,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303068898] [2021-08-26 09:18:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:18:19,842 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:18:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:18:19,843 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:18:19,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-26 09:18:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:18:21,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-26 09:18:21,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:18:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-26 09:18:22,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303068898] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:18:22,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:18:22,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2021-08-26 09:18:22,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818015556] [2021-08-26 09:18:22,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-26 09:18:22,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:18:22,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-26 09:18:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-08-26 09:18:22,701 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:19:13,302 INFO L93 Difference]: Finished difference Result 136667 states and 174665 transitions. [2021-08-26 09:19:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2021-08-26 09:19:13,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-08-26 09:19:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:19:13,514 INFO L225 Difference]: With dead ends: 136667 [2021-08-26 09:19:13,514 INFO L226 Difference]: Without dead ends: 127314 [2021-08-26 09:19:13,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92597 ImplicationChecksByTransitivity, 18466.0ms TimeCoverageRelationStatistics Valid=20838, Invalid=205262, Unknown=0, NotChecked=0, Total=226100 [2021-08-26 09:19:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127314 states. [2021-08-26 09:19:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127314 to 10187. [2021-08-26 09:19:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10187 states, 10186 states have (on average 1.2487728254466914) internal successors, (12720), 10186 states have internal predecessors, (12720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 12720 transitions. [2021-08-26 09:19:16,167 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 12720 transitions. Word has length 272 [2021-08-26 09:19:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:19:16,168 INFO L470 AbstractCegarLoop]: Abstraction has 10187 states and 12720 transitions. [2021-08-26 09:19:16,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 31 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 12720 transitions. [2021-08-26 09:19:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-26 09:19:16,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:19:16,176 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:19:16,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-26 09:19:16,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:19:16,378 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:19:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:19:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash 601585682, now seen corresponding path program 1 times [2021-08-26 09:19:16,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:19:16,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853646032] [2021-08-26 09:19:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:19:16,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:19:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:19:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-08-26 09:19:16,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:19:16,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853646032] [2021-08-26 09:19:16,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853646032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:19:16,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:19:16,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:19:16,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344854166] [2021-08-26 09:19:16,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:19:16,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:19:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:19:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:19:16,494 INFO L87 Difference]: Start difference. First operand 10187 states and 12720 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:19:18,735 INFO L93 Difference]: Finished difference Result 19918 states and 24931 transitions. [2021-08-26 09:19:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:19:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-08-26 09:19:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:19:18,747 INFO L225 Difference]: With dead ends: 19918 [2021-08-26 09:19:18,747 INFO L226 Difference]: Without dead ends: 10225 [2021-08-26 09:19:18,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:19:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10225 states. [2021-08-26 09:19:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10225 to 10073. [2021-08-26 09:19:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10073 states, 10072 states have (on average 1.2478157267672756) internal successors, (12568), 10072 states have internal predecessors, (12568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 12568 transitions. [2021-08-26 09:19:20,627 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 12568 transitions. Word has length 272 [2021-08-26 09:19:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:19:20,627 INFO L470 AbstractCegarLoop]: Abstraction has 10073 states and 12568 transitions. [2021-08-26 09:19:20,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 12568 transitions. [2021-08-26 09:19:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-26 09:19:20,634 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:19:20,635 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:19:20,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-26 09:19:20,635 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:19:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:19:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 83192022, now seen corresponding path program 1 times [2021-08-26 09:19:20,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:19:20,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834249639] [2021-08-26 09:19:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:19:20,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:19:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:19:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-08-26 09:19:20,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:19:20,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834249639] [2021-08-26 09:19:20,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834249639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:19:20,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:19:20,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:19:20,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368604078] [2021-08-26 09:19:20,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:19:20,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:19:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:19:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:19:20,722 INFO L87 Difference]: Start difference. First operand 10073 states and 12568 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:19:22,430 INFO L93 Difference]: Finished difference Result 16616 states and 20833 transitions. [2021-08-26 09:19:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:19:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2021-08-26 09:19:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:19:22,439 INFO L225 Difference]: With dead ends: 16616 [2021-08-26 09:19:22,440 INFO L226 Difference]: Without dead ends: 6965 [2021-08-26 09:19:22,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:19:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2021-08-26 09:19:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6965. [2021-08-26 09:19:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 6964 states have (on average 1.2498564043653073) internal successors, (8704), 6964 states have internal predecessors, (8704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 8704 transitions. [2021-08-26 09:19:23,887 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 8704 transitions. Word has length 272 [2021-08-26 09:19:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:19:23,887 INFO L470 AbstractCegarLoop]: Abstraction has 6965 states and 8704 transitions. [2021-08-26 09:19:23,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 8704 transitions. [2021-08-26 09:19:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2021-08-26 09:19:23,893 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:19:23,893 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:19:23,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-26 09:19:23,894 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:19:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:19:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1004446436, now seen corresponding path program 1 times [2021-08-26 09:19:23,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:19:23,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524971704] [2021-08-26 09:19:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:19:23,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:19:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:19:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-08-26 09:19:23,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:19:23,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524971704] [2021-08-26 09:19:23,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524971704] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:19:23,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:19:23,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:19:23,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834097900] [2021-08-26 09:19:23,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:19:23,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:19:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:19:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:19:23,983 INFO L87 Difference]: Start difference. First operand 6965 states and 8704 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:19:27,708 INFO L93 Difference]: Finished difference Result 17973 states and 22586 transitions. [2021-08-26 09:19:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 09:19:27,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2021-08-26 09:19:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:19:27,722 INFO L225 Difference]: With dead ends: 17973 [2021-08-26 09:19:27,723 INFO L226 Difference]: Without dead ends: 11650 [2021-08-26 09:19:27,727 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-26 09:19:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2021-08-26 09:19:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 6925. [2021-08-26 09:19:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6925 states, 6924 states have (on average 1.2484113229347198) internal successors, (8644), 6924 states have internal predecessors, (8644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8644 transitions. [2021-08-26 09:19:29,138 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8644 transitions. Word has length 274 [2021-08-26 09:19:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:19:29,138 INFO L470 AbstractCegarLoop]: Abstraction has 6925 states and 8644 transitions. [2021-08-26 09:19:29,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:19:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8644 transitions. [2021-08-26 09:19:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-08-26 09:19:29,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:19:29,144 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:19:29,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-26 09:19:29,144 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2021-08-26 09:19:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:19:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash 11587278, now seen corresponding path program 1 times [2021-08-26 09:19:29,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:19:29,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425219604] [2021-08-26 09:19:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:19:29,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:19:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:19:29,191 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 09:19:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:19:29,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 09:19:29,340 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 09:19:29,340 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:19:29,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-26 09:19:29,356 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:19:29,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:19:29 BoogieIcfgContainer [2021-08-26 09:19:29,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:19:29,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:19:29,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:19:29,597 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:19:29,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:33" (3/4) ... [2021-08-26 09:19:29,599 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 09:19:29,829 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:19:29,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:19:29,831 INFO L168 Benchmark]: Toolchain (without parser) took 237840.36 ms. Allocated memory was 56.6 MB in the beginning and 5.4 GB in the end (delta: 5.4 GB). Free memory was 35.5 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 759.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,832 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.0 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:19:29,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.65 ms. Allocated memory is still 56.6 MB. Free memory was 35.2 MB in the beginning and 36.4 MB in the end (delta: -1.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.70 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 30.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,834 INFO L168 Benchmark]: Boogie Preprocessor took 114.94 ms. Allocated memory is still 56.6 MB. Free memory was 30.2 MB in the beginning and 25.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,834 INFO L168 Benchmark]: RCFGBuilder took 1460.78 ms. Allocated memory was 56.6 MB in the beginning and 107.0 MB in the end (delta: 50.3 MB). Free memory was 25.1 MB in the beginning and 81.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,834 INFO L168 Benchmark]: TraceAbstraction took 235613.51 ms. Allocated memory was 107.0 MB in the beginning and 5.4 GB in the end (delta: 5.3 GB). Free memory was 80.4 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,834 INFO L168 Benchmark]: Witness Printer took 233.13 ms. Allocated memory is still 5.4 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:19:29,836 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.19 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.0 MB in the end (delta: 42.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 321.65 ms. Allocated memory is still 56.6 MB. Free memory was 35.2 MB in the beginning and 36.4 MB in the end (delta: -1.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.70 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 30.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 114.94 ms. Allocated memory is still 56.6 MB. Free memory was 30.2 MB in the beginning and 25.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1460.78 ms. Allocated memory was 56.6 MB in the beginning and 107.0 MB in the end (delta: 50.3 MB). Free memory was 25.1 MB in the beginning and 81.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 235613.51 ms. Allocated memory was 107.0 MB in the beginning and 5.4 GB in the end (delta: 5.3 GB). Free memory was 80.4 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.1 GB. * Witness Printer took 233.13 ms. Allocated memory is still 5.4 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 538]: 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 ; [L477] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; 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] [L480] int c1 ; [L481] int i2 ; [L484] c1 = 0 [L485] gate1Failed = __VERIFIER_nondet_bool() [L486] gate2Failed = __VERIFIER_nondet_bool() [L487] gate3Failed = __VERIFIER_nondet_bool() [L488] VALUE1 = __VERIFIER_nondet_char() [L489] VALUE2 = __VERIFIER_nondet_char() [L490] VALUE3 = __VERIFIER_nondet_char() [L491] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L493] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L496] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L499] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L500] votedValue_History_0 = __VERIFIER_nondet_char() [L501] votedValue_History_1 = __VERIFIER_nondet_char() [L502] votedValue_History_2 = __VERIFIER_nondet_char() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; [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 [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND TRUE history_id == 0 [L129] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) [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 [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND TRUE history_id == 1 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___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 [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND TRUE history_id == 2 [L129] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L139] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L149] COND TRUE history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) [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 [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND TRUE var < 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L75] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L81] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L87] COND FALSE !(history_id == 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L93] COND TRUE history_id == 3 [L109] COND TRUE history_id == 3 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L99] var ++ 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L74] COND FALSE !(var < 3) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L101] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L503] i2 = init() [L37] COND FALSE !(!cond) 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L505] g1v_old = nomsg [L506] g1v_new = nomsg [L507] g2v_old = nomsg [L508] g2v_new = nomsg [L509] g3v_old = nomsg [L510] g3v_new = nomsg [L511] i2 = 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=4, gate1Failed_History_0=0, gate1Failed_History_1=6, gate1Failed_History_2=2, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L512] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [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 [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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=10, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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 [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=7, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L189] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=8, gate3Failed_History_2=9, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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 [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L37] COND FALSE !(!cond) 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-2, VALUE2=-3, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=-4, votedValue_History_2=0] [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 [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L518] g1v_old = g1v_new [L519] g1v_new = nomsg [L520] g2v_old = g2v_new [L521] g2v_new = nomsg [L522] g3v_old = g3v_new [L523] g3v_new = nomsg [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L129] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L130] COND FALSE !(historyIndex == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 [L129] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L140] COND FALSE !(historyIndex == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 [L129] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L139] COND FALSE !(history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L149] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L150] COND FALSE !(historyIndex == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 [L109] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND FALSE !(historyIndex == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L109] COND TRUE history_id == 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L336] return (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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L524] c1 = check() [L536] COND FALSE !(! arg) 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=6, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L512] COND TRUE 1 [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [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 [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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L37] COND FALSE !(!cond) 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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) 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=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L184] COND FALSE !(history_id == 0) 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=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L189] COND FALSE !(history_id == 1) 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=0, gate3Failed_History_1=0, gate3Failed_History_2=8, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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=-4] [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=-4] [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, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [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, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-4] [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 [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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L518] g1v_old = g1v_new [L519] g1v_new = nomsg [L520] g2v_old = g2v_new [L521] g2v_new = nomsg [L522] g3v_old = g3v_new [L523] g3v_new = nomsg [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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) 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] [L129] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 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, 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 [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] [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, 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 [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] [L110] COND FALSE !(historyIndex == 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, 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 [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] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 [L109] COND TRUE history_id == 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, 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 [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] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg [L129] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 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, 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 [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] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) [L129] COND FALSE !(history_id == 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, 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 [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] [L140] COND FALSE !(historyIndex == 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, 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 [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] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) [L129] COND FALSE !(history_id == 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, 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 [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] [L149] COND TRUE history_id == 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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 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, 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 [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] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (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, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L524] c1 = check() [L536] COND TRUE ! arg 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] [L538] reach_error() 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] - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 521 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 235311.7ms, OverallIterations: 55, TraceHistogramMax: 3, EmptinessCheckTime: 192.0ms, AutomataDifference: 183914.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 29876 SDtfs, 56295 SDslu, 207330 SDs, 0 SdLazy, 67680 SolverSat, 1605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25333.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5510 GetRequests, 3134 SyntacticMatches, 4 SemanticMatches, 2372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337292 ImplicationChecksByTransitivity, 72695.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10897occurred in iteration=49, InterpolantAutomatonStates: 2223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 18045.7ms AutomataMinimizationTime, 54 MinimizatonAttempts, 401852 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1121.6ms SsaConstructionTime, 2576.7ms SatisfiabilityAnalysisTime, 17701.2ms InterpolantComputationTime, 12153 NumberOfCodeBlocks, 12153 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 11807 ConstructedInterpolants, 0 QuantifiedInterpolants, 38068 SizeOfPredicates, 93 NumberOfNonLiveVariables, 13020 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 68 InterpolantComputations, 42 PerfectInterpolantSequences, 6669/7385 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-08-26 09:19:29,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...