./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.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/psyco/psyco_abp_1-1.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 8e1064ca8851049d7703c5646c80faf613ee8a93 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-25 23:17:36,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 23:17:36,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 23:17:36,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 23:17:36,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 23:17:36,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 23:17:36,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 23:17:36,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 23:17:36,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 23:17:36,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 23:17:36,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 23:17:36,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 23:17:36,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 23:17:36,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 23:17:36,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 23:17:36,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 23:17:36,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 23:17:36,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 23:17:36,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 23:17:36,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 23:17:36,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 23:17:36,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 23:17:36,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 23:17:36,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 23:17:36,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 23:17:36,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 23:17:36,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 23:17:36,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 23:17:36,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 23:17:36,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 23:17:36,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 23:17:36,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 23:17:36,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 23:17:36,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 23:17:36,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 23:17:36,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 23:17:36,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 23:17:36,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 23:17:36,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 23:17:36,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 23:17:36,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 23:17:36,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 23:17:36,599 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 23:17:36,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 23:17:36,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 23:17:36,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 23:17:36,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 23:17:36,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 23:17:36,602 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 23:17:36,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 23:17:36,602 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 23:17:36,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 23:17:36,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 23:17:36,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 23:17:36,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 23:17:36,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 23:17:36,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 23:17:36,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 23:17:36,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 23:17:36,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 23:17:36,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 23:17:36,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 23:17:36,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 23:17:36,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 23:17:36,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 23:17:36,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 23:17:36,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 23:17:36,606 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 -> 8e1064ca8851049d7703c5646c80faf613ee8a93 [2021-08-25 23:17:36,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 23:17:36,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 23:17:36,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 23:17:36,880 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 23:17:36,881 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 23:17:36,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-08-25 23:17:36,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3efec752/4927f2599b1b48989cfa401888567294/FLAG25802ee4c [2021-08-25 23:17:37,322 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 23:17:37,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2021-08-25 23:17:37,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3efec752/4927f2599b1b48989cfa401888567294/FLAG25802ee4c [2021-08-25 23:17:37,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3efec752/4927f2599b1b48989cfa401888567294 [2021-08-25 23:17:37,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 23:17:37,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 23:17:37,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 23:17:37,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 23:17:37,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 23:17:37,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0d9f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37, skipping insertion in model container [2021-08-25 23:17:37,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 23:17:37,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 23:17:37,577 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/psyco/psyco_abp_1-1.c[24818,24831] [2021-08-25 23:17:37,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 23:17:37,594 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 23:17:37,655 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/psyco/psyco_abp_1-1.c[24818,24831] [2021-08-25 23:17:37,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 23:17:37,664 INFO L208 MainTranslator]: Completed translation [2021-08-25 23:17:37,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37 WrapperNode [2021-08-25 23:17:37,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 23:17:37,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 23:17:37,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 23:17:37,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 23:17:37,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 23:17:37,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 23:17:37,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 23:17:37,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 23:17:37,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 23:17:37,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 23:17:37,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 23:17:37,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 23:17:37,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (1/1) ... [2021-08-25 23:17:37,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 23:17:37,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:37,802 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-25 23:17:37,826 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-25 23:17:37,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 23:17:37,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 23:17:37,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 23:17:37,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 23:17:38,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 23:17:38,425 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-08-25 23:17:38,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 11:17:38 BoogieIcfgContainer [2021-08-25 23:17:38,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 23:17:38,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 23:17:38,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 23:17:38,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 23:17:38,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 11:17:37" (1/3) ... [2021-08-25 23:17:38,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3294f46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 11:17:38, skipping insertion in model container [2021-08-25 23:17:38,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 11:17:37" (2/3) ... [2021-08-25 23:17:38,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3294f46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 11:17:38, skipping insertion in model container [2021-08-25 23:17:38,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 11:17:38" (3/3) ... [2021-08-25 23:17:38,432 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2021-08-25 23:17:38,437 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 23:17:38,437 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 23:17:38,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 23:17:38,467 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-25 23:17:38,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 23:17:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 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-25 23:17:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-25 23:17:38,480 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:38,480 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:38,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2021-08-25 23:17:38,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:38,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718563492] [2021-08-25 23:17:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:38,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:38,577 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-25 23:17:38,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:38,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718563492] [2021-08-25 23:17:38,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718563492] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:38,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:38,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 23:17:38,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874396539] [2021-08-25 23:17:38,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-25 23:17:38,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:38,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-25 23:17:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 23:17:38,595 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.9537037037037037) internal successors, (211), 109 states have internal predecessors, (211), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:17:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:38,610 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2021-08-25 23:17:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 23:17:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:17:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:38,617 INFO L225 Difference]: With dead ends: 218 [2021-08-25 23:17:38,617 INFO L226 Difference]: Without dead ends: 106 [2021-08-25 23:17:38,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 23:17:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-25 23:17:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-25 23:17:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.6857142857142857) internal successors, (177), 105 states have internal predecessors, (177), 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-25 23:17:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2021-08-25 23:17:38,640 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2021-08-25 23:17:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:38,640 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2021-08-25 23:17:38,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-25 23:17:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2021-08-25 23:17:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 23:17:38,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:38,641 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:38,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 23:17:38,642 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2021-08-25 23:17:38,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:38,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480203860] [2021-08-25 23:17:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:38,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:38,675 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-25 23:17:38,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:38,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480203860] [2021-08-25 23:17:38,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480203860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:38,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:38,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:38,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581503747] [2021-08-25 23:17:38,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:38,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:38,678 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-25 23:17:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:38,712 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2021-08-25 23:17:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-08-25 23:17:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:38,714 INFO L225 Difference]: With dead ends: 214 [2021-08-25 23:17:38,714 INFO L226 Difference]: Without dead ends: 110 [2021-08-25 23:17:38,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-25 23:17:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-08-25 23:17:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 109 states have internal predecessors, (182), 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-25 23:17:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2021-08-25 23:17:38,720 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2021-08-25 23:17:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:38,721 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2021-08-25 23:17:38,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-25 23:17:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2021-08-25 23:17:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 23:17:38,721 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:38,722 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:38,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 23:17:38,722 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2021-08-25 23:17:38,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:38,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068152566] [2021-08-25 23:17:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:38,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:38,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:38,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068152566] [2021-08-25 23:17:38,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068152566] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:38,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:38,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:38,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424329208] [2021-08-25 23:17:38,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:38,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:38,843 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:17:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:39,002 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2021-08-25 23:17:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2021-08-25 23:17:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:39,004 INFO L225 Difference]: With dead ends: 324 [2021-08-25 23:17:39,004 INFO L226 Difference]: Without dead ends: 195 [2021-08-25 23:17:39,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-25 23:17:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2021-08-25 23:17:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.644808743169399) internal successors, (301), 183 states have internal predecessors, (301), 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-25 23:17:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2021-08-25 23:17:39,022 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2021-08-25 23:17:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:39,023 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2021-08-25 23:17:39,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 23:17:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2021-08-25 23:17:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-25 23:17:39,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:39,024 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:39,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 23:17:39,024 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2021-08-25 23:17:39,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:39,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90617667] [2021-08-25 23:17:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:39,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:39,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:39,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90617667] [2021-08-25 23:17:39,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90617667] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:39,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:39,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:39,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675790338] [2021-08-25 23:17:39,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:39,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:39,100 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-25 23:17:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:39,131 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2021-08-25 23:17:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-25 23:17:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:39,132 INFO L225 Difference]: With dead ends: 314 [2021-08-25 23:17:39,133 INFO L226 Difference]: Without dead ends: 133 [2021-08-25 23:17:39,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-25 23:17:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-08-25 23:17:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.623076923076923) internal successors, (211), 130 states have internal predecessors, (211), 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-25 23:17:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2021-08-25 23:17:39,138 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2021-08-25 23:17:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:39,139 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2021-08-25 23:17:39,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-25 23:17:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2021-08-25 23:17:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 23:17:39,140 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:39,140 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:39,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 23:17:39,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2021-08-25 23:17:39,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:39,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915388257] [2021-08-25 23:17:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:39,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 23:17:39,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:39,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915388257] [2021-08-25 23:17:39,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915388257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:39,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:39,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:39,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424235130] [2021-08-25 23:17:39,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:39,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:39,196 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-25 23:17:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:39,223 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2021-08-25 23:17:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2021-08-25 23:17:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:39,228 INFO L225 Difference]: With dead ends: 243 [2021-08-25 23:17:39,228 INFO L226 Difference]: Without dead ends: 115 [2021-08-25 23:17:39,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-25 23:17:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-08-25 23:17:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5892857142857142) internal successors, (178), 112 states have internal predecessors, (178), 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-25 23:17:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2021-08-25 23:17:39,245 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2021-08-25 23:17:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:39,245 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2021-08-25 23:17:39,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-25 23:17:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2021-08-25 23:17:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 23:17:39,246 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:39,246 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:39,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 23:17:39,247 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2021-08-25 23:17:39,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:39,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478098782] [2021-08-25 23:17:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:39,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:39,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:39,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478098782] [2021-08-25 23:17:39,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478098782] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:39,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091232873] [2021-08-25 23:17:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:39,308 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:39,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:39,310 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-25 23:17:39,320 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-25 23:17:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:39,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 23:17:39,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:39,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091232873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:39,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:39,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-25 23:17:39,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049941253] [2021-08-25 23:17:39,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 23:17:39,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:39,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 23:17:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 23:17:39,618 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-25 23:17:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:39,735 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2021-08-25 23:17:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 23:17:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 26 [2021-08-25 23:17:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:39,737 INFO L225 Difference]: With dead ends: 204 [2021-08-25 23:17:39,737 INFO L226 Difference]: Without dead ends: 192 [2021-08-25 23:17:39,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 23:17:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-25 23:17:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2021-08-25 23:17:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.6384180790960452) internal successors, (290), 177 states have internal predecessors, (290), 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-25 23:17:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2021-08-25 23:17:39,743 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2021-08-25 23:17:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:39,744 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2021-08-25 23:17:39,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-25 23:17:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2021-08-25 23:17:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 23:17:39,747 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:39,748 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:39,765 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-25 23:17:39,960 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-25 23:17:39,961 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2021-08-25 23:17:39,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:39,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295359298] [2021-08-25 23:17:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:39,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:40,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:40,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295359298] [2021-08-25 23:17:40,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295359298] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:40,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922357087] [2021-08-25 23:17:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:40,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:40,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:40,063 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-25 23:17:40,064 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-25 23:17:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:40,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-25 23:17:40,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:40,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922357087] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:40,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:40,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-08-25 23:17:40,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474162985] [2021-08-25 23:17:40,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 23:17:40,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 23:17:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 23:17:40,318 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-25 23:17:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:40,412 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2021-08-25 23:17:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 23:17:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 27 [2021-08-25 23:17:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:40,413 INFO L225 Difference]: With dead ends: 387 [2021-08-25 23:17:40,413 INFO L226 Difference]: Without dead ends: 230 [2021-08-25 23:17:40,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 25.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 23:17:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-25 23:17:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2021-08-25 23:17:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6233183856502242) internal successors, (362), 223 states have internal predecessors, (362), 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-25 23:17:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2021-08-25 23:17:40,418 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2021-08-25 23:17:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:40,418 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2021-08-25 23:17:40,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-25 23:17:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2021-08-25 23:17:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 23:17:40,418 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:40,419 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:40,438 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-25 23:17:40,637 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,SelfDestructingSolverStorable6 [2021-08-25 23:17:40,638 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2021-08-25 23:17:40,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:40,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571607440] [2021-08-25 23:17:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:40,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 23:17:40,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:40,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571607440] [2021-08-25 23:17:40,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571607440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:40,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:40,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:40,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41475512] [2021-08-25 23:17:40,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:40,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:40,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:40,671 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-25 23:17:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:40,691 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2021-08-25 23:17:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-25 23:17:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:40,693 INFO L225 Difference]: With dead ends: 409 [2021-08-25 23:17:40,693 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 23:17:40,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 23:17:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-08-25 23:17:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 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-25 23:17:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2021-08-25 23:17:40,698 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2021-08-25 23:17:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:40,698 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2021-08-25 23:17:40,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-25 23:17:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2021-08-25 23:17:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 23:17:40,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:40,703 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:40,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 23:17:40,704 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2021-08-25 23:17:40,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:40,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835482419] [2021-08-25 23:17:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:40,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-25 23:17:40,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:40,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835482419] [2021-08-25 23:17:40,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835482419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:40,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:40,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:40,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618565457] [2021-08-25 23:17:40,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:40,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:40,758 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-25 23:17:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:40,777 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2021-08-25 23:17:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 36 [2021-08-25 23:17:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:40,778 INFO L225 Difference]: With dead ends: 375 [2021-08-25 23:17:40,778 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 23:17:40,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 23:17:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-08-25 23:17:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5769230769230769) internal successors, (328), 208 states have internal predecessors, (328), 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-25 23:17:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2021-08-25 23:17:40,783 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2021-08-25 23:17:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:40,784 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2021-08-25 23:17:40,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-25 23:17:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2021-08-25 23:17:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 23:17:40,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:40,784 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:40,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 23:17:40,785 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2021-08-25 23:17:40,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:40,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168705726] [2021-08-25 23:17:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:40,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:40,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:40,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168705726] [2021-08-25 23:17:40,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168705726] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:40,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914519776] [2021-08-25 23:17:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:40,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:40,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:40,904 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-25 23:17:40,928 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-25 23:17:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:41,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 23:17:41,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-25 23:17:41,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914519776] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:41,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:41,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-08-25 23:17:41,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215762996] [2021-08-25 23:17:41,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 23:17:41,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 23:17:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 23:17:41,226 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-25 23:17:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:41,402 INFO L93 Difference]: Finished difference Result 490 states and 766 transitions. [2021-08-25 23:17:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 23:17:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 37 [2021-08-25 23:17:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:41,404 INFO L225 Difference]: With dead ends: 490 [2021-08-25 23:17:41,404 INFO L226 Difference]: Without dead ends: 275 [2021-08-25 23:17:41,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.8ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-25 23:17:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-25 23:17:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2021-08-25 23:17:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.5675675675675675) internal successors, (406), 259 states have internal predecessors, (406), 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-25 23:17:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2021-08-25 23:17:41,408 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2021-08-25 23:17:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:41,408 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2021-08-25 23:17:41,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-25 23:17:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2021-08-25 23:17:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 23:17:41,409 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:41,409 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:41,427 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-25 23:17:41,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:41,625 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2021-08-25 23:17:41,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:41,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28378553] [2021-08-25 23:17:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:41,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 23:17:41,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:41,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28378553] [2021-08-25 23:17:41,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28378553] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:41,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676371820] [2021-08-25 23:17:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:41,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:41,685 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-25 23:17:41,712 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-25 23:17:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:41,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-25 23:17:41,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 23:17:41,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676371820] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:41,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:41,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 23:17:41,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133619964] [2021-08-25 23:17:41,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 23:17:41,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 23:17:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 23:17:41,948 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-25 23:17:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:42,017 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2021-08-25 23:17:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 23:17:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 38 [2021-08-25 23:17:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:42,019 INFO L225 Difference]: With dead ends: 274 [2021-08-25 23:17:42,020 INFO L226 Difference]: Without dead ends: 262 [2021-08-25 23:17:42,020 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 23:17:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-25 23:17:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2021-08-25 23:17:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.5212355212355213) internal successors, (394), 259 states have internal predecessors, (394), 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-25 23:17:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2021-08-25 23:17:42,024 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2021-08-25 23:17:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:42,025 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2021-08-25 23:17:42,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-25 23:17:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2021-08-25 23:17:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 23:17:42,025 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:42,025 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:42,045 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-25 23:17:42,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:42,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2021-08-25 23:17:42,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:42,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657011452] [2021-08-25 23:17:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:42,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:42,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:42,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657011452] [2021-08-25 23:17:42,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657011452] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:42,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116593746] [2021-08-25 23:17:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:42,546 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:42,548 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-25 23:17:42,550 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-25 23:17:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:42,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-25 23:17:42,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:43,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116593746] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:43,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:43,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2021-08-25 23:17:43,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762534043] [2021-08-25 23:17:43,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 23:17:43,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 23:17:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-25 23:17:43,109 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-25 23:17:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:43,328 INFO L93 Difference]: Finished difference Result 274 states and 404 transitions. [2021-08-25 23:17:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 23:17:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 40 [2021-08-25 23:17:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:43,329 INFO L225 Difference]: With dead ends: 274 [2021-08-25 23:17:43,329 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 23:17:43,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:17:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 23:17:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2021-08-25 23:17:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5192307692307692) internal successors, (395), 260 states have internal predecessors, (395), 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-25 23:17:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2021-08-25 23:17:43,334 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2021-08-25 23:17:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:43,334 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2021-08-25 23:17:43,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-25 23:17:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2021-08-25 23:17:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 23:17:43,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:43,334 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:43,352 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-25 23:17:43,542 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,SelfDestructingSolverStorable11 [2021-08-25 23:17:43,542 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2021-08-25 23:17:43,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:43,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915127996] [2021-08-25 23:17:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:43,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-25 23:17:43,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:43,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915127996] [2021-08-25 23:17:43,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915127996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:43,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:43,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:43,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353288852] [2021-08-25 23:17:43,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:43,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:43,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:43,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:43,568 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-25 23:17:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:43,587 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2021-08-25 23:17:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:43,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 41 [2021-08-25 23:17:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:43,589 INFO L225 Difference]: With dead ends: 461 [2021-08-25 23:17:43,589 INFO L226 Difference]: Without dead ends: 245 [2021-08-25 23:17:43,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-08-25 23:17:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2021-08-25 23:17:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.487603305785124) internal successors, (360), 242 states have internal predecessors, (360), 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-25 23:17:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2021-08-25 23:17:43,593 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2021-08-25 23:17:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:43,593 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2021-08-25 23:17:43,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-25 23:17:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2021-08-25 23:17:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 23:17:43,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:43,595 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:43,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 23:17:43,595 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2021-08-25 23:17:43,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:43,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059701308] [2021-08-25 23:17:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:43,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-25 23:17:43,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:43,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059701308] [2021-08-25 23:17:43,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059701308] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:17:43,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 23:17:43,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 23:17:43,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989235208] [2021-08-25 23:17:43,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 23:17:43,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 23:17:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:43,643 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-25 23:17:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:43,661 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2021-08-25 23:17:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 23:17:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-25 23:17:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:43,662 INFO L225 Difference]: With dead ends: 333 [2021-08-25 23:17:43,662 INFO L226 Difference]: Without dead ends: 155 [2021-08-25 23:17:43,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 23:17:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-25 23:17:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2021-08-25 23:17:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 152 states have internal predecessors, (219), 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-25 23:17:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2021-08-25 23:17:43,665 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2021-08-25 23:17:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:43,665 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2021-08-25 23:17:43,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-25 23:17:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2021-08-25 23:17:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-25 23:17:43,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:43,666 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:43,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 23:17:43,666 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2021-08-25 23:17:43,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:43,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935584614] [2021-08-25 23:17:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:43,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-25 23:17:43,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:43,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935584614] [2021-08-25 23:17:43,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935584614] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:43,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29186044] [2021-08-25 23:17:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:43,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:43,733 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-25 23:17:43,734 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-25 23:17:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:43,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 23:17:43,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-25 23:17:44,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29186044] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:44,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:44,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-25 23:17:44,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484113043] [2021-08-25 23:17:44,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 23:17:44,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:44,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 23:17:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 23:17:44,164 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-25 23:17:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:44,215 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2021-08-25 23:17:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 23:17:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 52 [2021-08-25 23:17:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:44,216 INFO L225 Difference]: With dead ends: 286 [2021-08-25 23:17:44,216 INFO L226 Difference]: Without dead ends: 194 [2021-08-25 23:17:44,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 23:17:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-25 23:17:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2021-08-25 23:17:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.436842105263158) internal successors, (273), 190 states have internal predecessors, (273), 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-25 23:17:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2021-08-25 23:17:44,220 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2021-08-25 23:17:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:44,220 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2021-08-25 23:17:44,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-25 23:17:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2021-08-25 23:17:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-25 23:17:44,221 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:44,221 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:44,239 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-25 23:17:44,432 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,SelfDestructingSolverStorable14 [2021-08-25 23:17:44,433 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:44,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2021-08-25 23:17:44,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:44,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592758382] [2021-08-25 23:17:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:44,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:44,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:44,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592758382] [2021-08-25 23:17:44,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592758382] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:44,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915688523] [2021-08-25 23:17:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:44,554 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:44,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:44,555 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-25 23:17:44,556 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-25 23:17:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:44,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-25 23:17:44,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:45,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915688523] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:45,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:45,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-08-25 23:17:45,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208781446] [2021-08-25 23:17:45,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 23:17:45,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 23:17:45,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-25 23:17:45,178 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-25 23:17:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:45,250 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2021-08-25 23:17:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 23:17:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 56 [2021-08-25 23:17:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:45,251 INFO L225 Difference]: With dead ends: 193 [2021-08-25 23:17:45,251 INFO L226 Difference]: Without dead ends: 191 [2021-08-25 23:17:45,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-25 23:17:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-25 23:17:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-08-25 23:17:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.431578947368421) internal successors, (272), 190 states have internal predecessors, (272), 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-25 23:17:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2021-08-25 23:17:45,255 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2021-08-25 23:17:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:45,256 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2021-08-25 23:17:45,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-25 23:17:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2021-08-25 23:17:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-25 23:17:45,256 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:45,256 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:45,279 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-25 23:17:45,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:45,473 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:45,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2021-08-25 23:17:45,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:45,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374110039] [2021-08-25 23:17:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:45,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:45,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:45,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374110039] [2021-08-25 23:17:45,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374110039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:45,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809093345] [2021-08-25 23:17:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:45,718 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:45,719 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-25 23:17:45,720 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-25 23:17:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:45,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-25 23:17:45,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:46,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809093345] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:46,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:46,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-08-25 23:17:46,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769127118] [2021-08-25 23:17:46,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 23:17:46,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 23:17:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:17:46,552 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-25 23:17:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:46,712 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2021-08-25 23:17:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 23:17:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 63 [2021-08-25 23:17:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:46,714 INFO L225 Difference]: With dead ends: 197 [2021-08-25 23:17:46,714 INFO L226 Difference]: Without dead ends: 195 [2021-08-25 23:17:46,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.1ms TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-25 23:17:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-25 23:17:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2021-08-25 23:17:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4293193717277486) internal successors, (273), 191 states have internal predecessors, (273), 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-25 23:17:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2021-08-25 23:17:46,718 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2021-08-25 23:17:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:46,719 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2021-08-25 23:17:46,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-25 23:17:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2021-08-25 23:17:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 23:17:46,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:46,719 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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-25 23:17:46,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-25 23:17:46,932 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,SelfDestructingSolverStorable16 [2021-08-25 23:17:46,933 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2021-08-25 23:17:46,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:46,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114875955] [2021-08-25 23:17:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:46,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:47,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:47,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114875955] [2021-08-25 23:17:47,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114875955] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:47,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445243998] [2021-08-25 23:17:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:47,061 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:47,067 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-25 23:17:47,068 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-25 23:17:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:47,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-25 23:17:47,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:47,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445243998] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:47,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:47,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-08-25 23:17:47,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664936875] [2021-08-25 23:17:47,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 23:17:47,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 23:17:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-25 23:17:47,970 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-25 23:17:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:48,083 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2021-08-25 23:17:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 23:17:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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 73 [2021-08-25 23:17:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:48,085 INFO L225 Difference]: With dead ends: 301 [2021-08-25 23:17:48,085 INFO L226 Difference]: Without dead ends: 211 [2021-08-25 23:17:48,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-25 23:17:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-25 23:17:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-08-25 23:17:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4238095238095239) internal successors, (299), 210 states have internal predecessors, (299), 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-25 23:17:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2021-08-25 23:17:48,089 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2021-08-25 23:17:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:48,090 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2021-08-25 23:17:48,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-25 23:17:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2021-08-25 23:17:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 23:17:48,093 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:48,093 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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-25 23:17:48,112 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-25 23:17:48,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-25 23:17:48,309 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:48,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:48,309 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2021-08-25 23:17:48,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:48,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503430792] [2021-08-25 23:17:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:48,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-25 23:17:48,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:48,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503430792] [2021-08-25 23:17:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503430792] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:48,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031587260] [2021-08-25 23:17:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:48,425 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:48,426 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-25 23:17:48,457 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-25 23:17:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:48,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-25 23:17:48,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 23:17:49,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031587260] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:49,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:49,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-08-25 23:17:49,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716127056] [2021-08-25 23:17:49,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 23:17:49,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:49,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 23:17:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:17:49,276 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-25 23:17:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:49,488 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2021-08-25 23:17:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 23:17:49,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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 83 [2021-08-25 23:17:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:49,489 INFO L225 Difference]: With dead ends: 329 [2021-08-25 23:17:49,489 INFO L226 Difference]: Without dead ends: 239 [2021-08-25 23:17:49,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 68.8ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-25 23:17:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-25 23:17:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2021-08-25 23:17:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 229 states have internal predecessors, (325), 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-25 23:17:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2021-08-25 23:17:49,493 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2021-08-25 23:17:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:49,493 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2021-08-25 23:17:49,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-25 23:17:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2021-08-25 23:17:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 23:17:49,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:49,494 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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] [2021-08-25 23:17:49,513 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-25 23:17:49,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:49,695 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2021-08-25 23:17:49,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:49,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389649928] [2021-08-25 23:17:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:49,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:49,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:49,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389649928] [2021-08-25 23:17:49,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389649928] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:49,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722022674] [2021-08-25 23:17:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:49,912 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:49,912 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-25 23:17:49,913 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-25 23:17:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:50,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-25 23:17:50,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:51,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722022674] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:51,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:51,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-08-25 23:17:51,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209178278] [2021-08-25 23:17:51,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 23:17:51,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 23:17:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:17:51,227 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-25 23:17:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:51,338 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2021-08-25 23:17:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 23:17:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 86 [2021-08-25 23:17:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:51,339 INFO L225 Difference]: With dead ends: 233 [2021-08-25 23:17:51,339 INFO L226 Difference]: Without dead ends: 231 [2021-08-25 23:17:51,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:17:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-25 23:17:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-08-25 23:17:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 230 states have internal predecessors, (326), 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-25 23:17:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2021-08-25 23:17:51,344 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2021-08-25 23:17:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:51,344 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2021-08-25 23:17:51,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-25 23:17:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2021-08-25 23:17:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 23:17:51,345 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:51,345 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 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] [2021-08-25 23:17:51,365 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-25 23:17:51,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:51,559 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2021-08-25 23:17:51,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:51,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576749290] [2021-08-25 23:17:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:51,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 23:17:51,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:51,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576749290] [2021-08-25 23:17:51,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576749290] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:51,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921954164] [2021-08-25 23:17:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:51,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:51,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:51,650 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-25 23:17:51,676 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-25 23:17:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:52,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-25 23:17:52,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 23:17:52,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921954164] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:52,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:52,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-08-25 23:17:52,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221132814] [2021-08-25 23:17:52,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 23:17:52,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 23:17:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 23:17:52,699 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-25 23:17:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:52,795 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2021-08-25 23:17:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 23:17:52,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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 98 [2021-08-25 23:17:52,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:52,801 INFO L225 Difference]: With dead ends: 364 [2021-08-25 23:17:52,801 INFO L226 Difference]: Without dead ends: 272 [2021-08-25 23:17:52,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 23:17:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-25 23:17:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2021-08-25 23:17:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4179104477611941) internal successors, (380), 268 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-25 23:17:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2021-08-25 23:17:52,805 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2021-08-25 23:17:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:52,805 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2021-08-25 23:17:52,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-25 23:17:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2021-08-25 23:17:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-25 23:17:52,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:52,806 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 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] [2021-08-25 23:17:52,827 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-25 23:17:53,024 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,SelfDestructingSolverStorable20 [2021-08-25 23:17:53,024 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2021-08-25 23:17:53,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:53,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608967442] [2021-08-25 23:17:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:53,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:53,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:53,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608967442] [2021-08-25 23:17:53,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608967442] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:53,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547105147] [2021-08-25 23:17:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:53,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:53,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:53,164 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-25 23:17:53,166 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-25 23:17:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:53,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-25 23:17:53,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:54,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547105147] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:54,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:54,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-25 23:17:54,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779149507] [2021-08-25 23:17:54,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 23:17:54,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 23:17:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-08-25 23:17:54,574 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 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-25 23:17:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:54,722 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2021-08-25 23:17:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 23:17:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 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 102 [2021-08-25 23:17:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:54,725 INFO L225 Difference]: With dead ends: 271 [2021-08-25 23:17:54,725 INFO L226 Difference]: Without dead ends: 269 [2021-08-25 23:17:54,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.3ms TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-08-25 23:17:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-08-25 23:17:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2021-08-25 23:17:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.414179104477612) internal successors, (379), 268 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-25 23:17:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2021-08-25 23:17:54,731 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2021-08-25 23:17:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:54,732 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2021-08-25 23:17:54,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 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-25 23:17:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2021-08-25 23:17:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-25 23:17:54,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:54,733 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:54,753 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-25 23:17:54,950 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,SelfDestructingSolverStorable21 [2021-08-25 23:17:54,951 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2021-08-25 23:17:54,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:54,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924404758] [2021-08-25 23:17:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:54,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:55,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:55,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924404758] [2021-08-25 23:17:55,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924404758] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:55,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288241526] [2021-08-25 23:17:55,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:17:55,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:55,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:55,238 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-25 23:17:55,239 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-25 23:17:55,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:17:55,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:17:55,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-25 23:17:55,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:57,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288241526] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:57,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:57,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-08-25 23:17:57,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133902830] [2021-08-25 23:17:57,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-25 23:17:57,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:57,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-25 23:17:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:17:57,020 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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-25 23:17:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:57,290 INFO L93 Difference]: Finished difference Result 276 states and 385 transitions. [2021-08-25 23:17:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-25 23:17:57,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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 109 [2021-08-25 23:17:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:57,291 INFO L225 Difference]: With dead ends: 276 [2021-08-25 23:17:57,291 INFO L226 Difference]: Without dead ends: 274 [2021-08-25 23:17:57,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 141.0ms TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-25 23:17:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-08-25 23:17:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2021-08-25 23:17:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.412639405204461) internal successors, (380), 269 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-25 23:17:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2021-08-25 23:17:57,296 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2021-08-25 23:17:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:57,296 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2021-08-25 23:17:57,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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-25 23:17:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2021-08-25 23:17:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-25 23:17:57,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:57,297 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:57,318 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-25 23:17:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:57,507 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2021-08-25 23:17:57,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:57,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827701559] [2021-08-25 23:17:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:57,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:57,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:57,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827701559] [2021-08-25 23:17:57,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827701559] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:57,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893401891] [2021-08-25 23:17:57,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:17:57,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:57,745 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:17:57,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-25 23:17:58,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:17:58,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:17:58,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-25 23:17:58,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:17:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:17:59,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893401891] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:59,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:17:59,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-08-25 23:17:59,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181063943] [2021-08-25 23:17:59,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-25 23:17:59,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:17:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-25 23:17:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-08-25 23:17:59,334 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand has 22 states, 22 states have (on average 10.090909090909092) internal successors, (222), 22 states have internal predecessors, (222), 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-25 23:17:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:17:59,612 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2021-08-25 23:17:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 23:17:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.090909090909092) internal successors, (222), 22 states have internal predecessors, (222), 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-25 23:17:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:17:59,614 INFO L225 Difference]: With dead ends: 379 [2021-08-25 23:17:59,614 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 23:17:59,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 202.4ms TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-08-25 23:17:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 23:17:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-08-25 23:17:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4097222222222223) internal successors, (406), 288 states have internal predecessors, (406), 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-25 23:17:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2021-08-25 23:17:59,619 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2021-08-25 23:17:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:17:59,619 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2021-08-25 23:17:59,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.090909090909092) internal successors, (222), 22 states have internal predecessors, (222), 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-25 23:17:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2021-08-25 23:17:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-08-25 23:17:59,620 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:17:59,620 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:17:59,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-25 23:17:59,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:59,837 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:17:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:17:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2021-08-25 23:17:59,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:17:59,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380384720] [2021-08-25 23:17:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:17:59,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:17:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:17:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 304 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-25 23:17:59,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:17:59,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380384720] [2021-08-25 23:17:59,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380384720] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:17:59,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215450146] [2021-08-25 23:17:59,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:17:59,991 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:17:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:17:59,993 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-25 23:18:00,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:00,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:00,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-25 23:18:00,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 23:18:01,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215450146] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:01,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:01,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2021-08-25 23:18:01,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030354871] [2021-08-25 23:18:01,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 23:18:01,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:01,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 23:18:01,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-25 23:18:01,571 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 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-25 23:18:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:01,756 INFO L93 Difference]: Finished difference Result 406 states and 576 transitions. [2021-08-25 23:18:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 23:18:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 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 129 [2021-08-25 23:18:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:01,758 INFO L225 Difference]: With dead ends: 406 [2021-08-25 23:18:01,758 INFO L226 Difference]: Without dead ends: 316 [2021-08-25 23:18:01,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:18:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-25 23:18:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 308. [2021-08-25 23:18:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4071661237785016) internal successors, (432), 307 states have internal predecessors, (432), 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-25 23:18:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2021-08-25 23:18:01,763 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2021-08-25 23:18:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:01,763 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2021-08-25 23:18:01,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 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-25 23:18:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2021-08-25 23:18:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 23:18:01,764 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:01,764 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:01,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-25 23:18:01,984 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2021-08-25 23:18:01,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:01,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083490243] [2021-08-25 23:18:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:01,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:02,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:02,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083490243] [2021-08-25 23:18:02,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083490243] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:02,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529590519] [2021-08-25 23:18:02,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:18:02,366 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:02,367 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:02,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-25 23:18:03,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:03,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:03,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-25 23:18:03,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:04,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529590519] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:04,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:04,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-08-25 23:18:04,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296406154] [2021-08-25 23:18:04,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-25 23:18:04,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-25 23:18:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:18:04,674 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 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-25 23:18:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:04,870 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2021-08-25 23:18:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 23:18:04,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 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 132 [2021-08-25 23:18:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:04,872 INFO L225 Difference]: With dead ends: 311 [2021-08-25 23:18:04,872 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 23:18:04,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:18:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 23:18:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-08-25 23:18:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.405844155844156) internal successors, (433), 308 states have internal predecessors, (433), 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-25 23:18:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2021-08-25 23:18:04,877 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2021-08-25 23:18:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:04,877 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2021-08-25 23:18:04,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 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-25 23:18:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2021-08-25 23:18:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-08-25 23:18:04,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:04,878 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:04,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:05,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-25 23:18:05,093 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2021-08-25 23:18:05,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:05,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996104989] [2021-08-25 23:18:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:05,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 23:18:05,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:05,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996104989] [2021-08-25 23:18:05,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996104989] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:05,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414214746] [2021-08-25 23:18:05,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:18:05,231 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:05,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:05,232 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:05,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-25 23:18:06,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:06,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:06,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-25 23:18:06,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 23:18:07,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414214746] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:07,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:07,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-08-25 23:18:07,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978818229] [2021-08-25 23:18:07,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 23:18:07,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 23:18:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:18:07,111 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-25 23:18:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:07,251 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2021-08-25 23:18:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 23:18:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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 144 [2021-08-25 23:18:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:07,253 INFO L225 Difference]: With dead ends: 442 [2021-08-25 23:18:07,253 INFO L226 Difference]: Without dead ends: 350 [2021-08-25 23:18:07,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8ms TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-25 23:18:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-08-25 23:18:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2021-08-25 23:18:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.407514450867052) internal successors, (487), 346 states have internal predecessors, (487), 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-25 23:18:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2021-08-25 23:18:07,259 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2021-08-25 23:18:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:07,260 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2021-08-25 23:18:07,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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-25 23:18:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2021-08-25 23:18:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-25 23:18:07,261 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:07,261 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:07,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:07,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-25 23:18:07,475 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2021-08-25 23:18:07,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:07,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557983828] [2021-08-25 23:18:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:07,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:07,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:07,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557983828] [2021-08-25 23:18:07,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557983828] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:07,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198750518] [2021-08-25 23:18:07,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:18:07,716 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:07,717 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:07,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-25 23:18:08,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:08,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:09,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-25 23:18:09,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:09,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198750518] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:09,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:09,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-25 23:18:09,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489891999] [2021-08-25 23:18:09,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-25 23:18:09,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:09,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-25 23:18:09,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2021-08-25 23:18:09,880 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand has 25 states, 25 states have (on average 11.2) internal successors, (280), 25 states have internal predecessors, (280), 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-25 23:18:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:10,126 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2021-08-25 23:18:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-25 23:18:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 25 states have internal predecessors, (280), 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 148 [2021-08-25 23:18:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:10,127 INFO L225 Difference]: With dead ends: 349 [2021-08-25 23:18:10,127 INFO L226 Difference]: Without dead ends: 347 [2021-08-25 23:18:10,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 243.0ms TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2021-08-25 23:18:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-08-25 23:18:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2021-08-25 23:18:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4046242774566473) internal successors, (486), 346 states have internal predecessors, (486), 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-25 23:18:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2021-08-25 23:18:10,132 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2021-08-25 23:18:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:10,133 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2021-08-25 23:18:10,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 25 states have internal predecessors, (280), 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-25 23:18:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2021-08-25 23:18:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 23:18:10,133 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:10,134 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:10,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:10,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:10,343 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2021-08-25 23:18:10,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:10,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002297362] [2021-08-25 23:18:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:10,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:10,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:10,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002297362] [2021-08-25 23:18:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002297362] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:10,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942500927] [2021-08-25 23:18:10,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 23:18:10,666 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:10,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:10,669 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:10,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-25 23:18:12,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-08-25 23:18:12,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:12,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-25 23:18:12,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 248 proven. 32 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2021-08-25 23:18:12,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942500927] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:12,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:12,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2021-08-25 23:18:12,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112808323] [2021-08-25 23:18:12,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-25 23:18:12,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-25 23:18:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:12,584 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 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-25 23:18:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:13,174 INFO L93 Difference]: Finished difference Result 544 states and 765 transitions. [2021-08-25 23:18:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-25 23:18:13,174 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 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 155 [2021-08-25 23:18:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:13,176 INFO L225 Difference]: With dead ends: 544 [2021-08-25 23:18:13,176 INFO L226 Difference]: Without dead ends: 448 [2021-08-25 23:18:13,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 358.8ms TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2021-08-25 23:18:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-08-25 23:18:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2021-08-25 23:18:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4103773584905661) internal successors, (598), 424 states have internal predecessors, (598), 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-25 23:18:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2021-08-25 23:18:13,183 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2021-08-25 23:18:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:13,183 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2021-08-25 23:18:13,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.947368421052632) internal successors, (227), 19 states have internal predecessors, (227), 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-25 23:18:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2021-08-25 23:18:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-08-25 23:18:13,184 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:13,184 INFO L512 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:13,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:13,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-25 23:18:13,400 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2021-08-25 23:18:13,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:13,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113316881] [2021-08-25 23:18:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:13,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 23:18:13,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:13,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113316881] [2021-08-25 23:18:13,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113316881] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:13,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666891089] [2021-08-25 23:18:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:13,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:13,501 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:13,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-25 23:18:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:14,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-25 23:18:14,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 23:18:15,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666891089] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:15,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:15,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-25 23:18:15,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660625878] [2021-08-25 23:18:15,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 23:18:15,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 23:18:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-25 23:18:15,368 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 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-25 23:18:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:15,487 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2021-08-25 23:18:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 23:18:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 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 165 [2021-08-25 23:18:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:15,489 INFO L225 Difference]: With dead ends: 927 [2021-08-25 23:18:15,489 INFO L226 Difference]: Without dead ends: 760 [2021-08-25 23:18:15,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-25 23:18:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-08-25 23:18:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2021-08-25 23:18:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.4080779944289694) internal successors, (1011), 718 states have internal predecessors, (1011), 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-25 23:18:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2021-08-25 23:18:15,498 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2021-08-25 23:18:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:15,499 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2021-08-25 23:18:15,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 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-25 23:18:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2021-08-25 23:18:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-08-25 23:18:15,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:15,500 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 23:18:15,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:15,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:15,700 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2021-08-25 23:18:15,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:15,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500984690] [2021-08-25 23:18:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:15,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 45 proven. 616 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-25 23:18:15,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:15,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500984690] [2021-08-25 23:18:15,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500984690] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:15,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120998811] [2021-08-25 23:18:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:15,958 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:15,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:15,969 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:15,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-25 23:18:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:17,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-25 23:18:17,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-25 23:18:17,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120998811] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 23:18:17,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 23:18:17,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-08-25 23:18:17,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684525891] [2021-08-25 23:18:17,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 23:18:17,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 23:18:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:17,996 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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-25 23:18:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:18,082 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2021-08-25 23:18:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 23:18:18,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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-25 23:18:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:18,084 INFO L225 Difference]: With dead ends: 860 [2021-08-25 23:18:18,084 INFO L226 Difference]: Without dead ends: 856 [2021-08-25 23:18:18,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 123.9ms TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-08-25 23:18:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2021-08-25 23:18:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.4101057579318448) internal successors, (1200), 851 states have internal predecessors, (1200), 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-25 23:18:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2021-08-25 23:18:18,094 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2021-08-25 23:18:18,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:18,095 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2021-08-25 23:18:18,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 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-25 23:18:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2021-08-25 23:18:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-08-25 23:18:18,096 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:18,096 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:18,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:18,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:18,313 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2021-08-25 23:18:18,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:18,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22695540] [2021-08-25 23:18:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:18,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:18,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:18,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22695540] [2021-08-25 23:18:18,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22695540] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:18,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997738389] [2021-08-25 23:18:18,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 23:18:18,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:18,699 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:18,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-25 23:18:20,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-08-25 23:18:20,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:20,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-25 23:18:20,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 554 proven. 137 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-25 23:18:21,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997738389] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:21,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:21,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-08-25 23:18:21,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976811686] [2021-08-25 23:18:21,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-25 23:18:21,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-25 23:18:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2021-08-25 23:18:21,287 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand has 32 states, 32 states have (on average 10.59375) internal successors, (339), 32 states have internal predecessors, (339), 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-25 23:18:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:21,897 INFO L93 Difference]: Finished difference Result 867 states and 1213 transitions. [2021-08-25 23:18:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-25 23:18:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.59375) internal successors, (339), 32 states have internal predecessors, (339), 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-25 23:18:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:21,900 INFO L225 Difference]: With dead ends: 867 [2021-08-25 23:18:21,900 INFO L226 Difference]: Without dead ends: 865 [2021-08-25 23:18:21,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 624.6ms TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2021-08-25 23:18:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2021-08-25 23:18:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 852. [2021-08-25 23:18:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.408930669800235) internal successors, (1199), 851 states have internal predecessors, (1199), 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-25 23:18:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2021-08-25 23:18:21,911 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2021-08-25 23:18:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:21,912 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2021-08-25 23:18:21,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.59375) internal successors, (339), 32 states have internal predecessors, (339), 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-25 23:18:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2021-08-25 23:18:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-08-25 23:18:21,913 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:21,913 INFO L512 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:21,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:22,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:22,125 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2021-08-25 23:18:22,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:22,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726813411] [2021-08-25 23:18:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:22,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-25 23:18:22,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:22,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726813411] [2021-08-25 23:18:22,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726813411] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:22,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510588443] [2021-08-25 23:18:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:22,234 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:22,235 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:22,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-25 23:18:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:23,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-25 23:18:23,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-25 23:18:24,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510588443] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:24,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:24,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-25 23:18:24,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455011656] [2021-08-25 23:18:24,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-25 23:18:24,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-25 23:18:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-25 23:18:24,337 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 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-25 23:18:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:24,444 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2021-08-25 23:18:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 23:18:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 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 193 [2021-08-25 23:18:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:24,447 INFO L225 Difference]: With dead ends: 1435 [2021-08-25 23:18:24,447 INFO L226 Difference]: Without dead ends: 959 [2021-08-25 23:18:24,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-25 23:18:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-25 23:18:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2021-08-25 23:18:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.411194833153929) internal successors, (1311), 929 states have internal predecessors, (1311), 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-25 23:18:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2021-08-25 23:18:24,460 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2021-08-25 23:18:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:24,460 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2021-08-25 23:18:24,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 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-25 23:18:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2021-08-25 23:18:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-25 23:18:24,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:24,461 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:24,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:24,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:24,677 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:24,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2021-08-25 23:18:24,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:24,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56150337] [2021-08-25 23:18:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:24,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:24,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:24,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56150337] [2021-08-25 23:18:24,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56150337] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:24,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952621140] [2021-08-25 23:18:24,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 23:18:24,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:24,980 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:24,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-25 23:18:26,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-08-25 23:18:26,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:26,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 54 conjunts are in the unsatisfiable core [2021-08-25 23:18:26,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 478 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 23:18:28,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952621140] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:28,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:28,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2021-08-25 23:18:28,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981280880] [2021-08-25 23:18:28,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-25 23:18:28,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:28,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-25 23:18:28,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2021-08-25 23:18:28,156 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 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-25 23:18:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:28,511 INFO L93 Difference]: Finished difference Result 934 states and 1313 transitions. [2021-08-25 23:18:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-25 23:18:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 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) Word has length 194 [2021-08-25 23:18:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:28,513 INFO L225 Difference]: With dead ends: 934 [2021-08-25 23:18:28,513 INFO L226 Difference]: Without dead ends: 932 [2021-08-25 23:18:28,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 512.5ms TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2021-08-25 23:18:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-08-25 23:18:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 930. [2021-08-25 23:18:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.4090419806243273) internal successors, (1309), 929 states have internal predecessors, (1309), 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-25 23:18:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2021-08-25 23:18:28,524 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2021-08-25 23:18:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:28,524 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2021-08-25 23:18:28,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 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-25 23:18:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2021-08-25 23:18:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-08-25 23:18:28,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:28,526 INFO L512 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:28,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:28,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-08-25 23:18:28,745 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2021-08-25 23:18:28,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:28,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522080453] [2021-08-25 23:18:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:28,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 23:18:28,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:28,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522080453] [2021-08-25 23:18:28,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522080453] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:28,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350642779] [2021-08-25 23:18:28,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:18:28,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:28,876 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:28,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-25 23:18:30,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:30,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-25 23:18:30,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 23:18:31,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350642779] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:31,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:31,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-25 23:18:31,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324803722] [2021-08-25 23:18:31,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-25 23:18:31,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:31,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-25 23:18:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:18:31,248 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand has 13 states, 13 states have (on average 14.384615384615385) internal successors, (187), 13 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-25 23:18:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:31,386 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2021-08-25 23:18:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 23:18:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.384615384615385) internal successors, (187), 13 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 211 [2021-08-25 23:18:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:31,389 INFO L225 Difference]: With dead ends: 1125 [2021-08-25 23:18:31,389 INFO L226 Difference]: Without dead ends: 1040 [2021-08-25 23:18:31,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-25 23:18:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-08-25 23:18:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2021-08-25 23:18:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.4061569016881827) internal successors, (1416), 1007 states have internal predecessors, (1416), 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-25 23:18:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2021-08-25 23:18:31,402 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2021-08-25 23:18:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:31,403 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2021-08-25 23:18:31,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.384615384615385) internal successors, (187), 13 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-25 23:18:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2021-08-25 23:18:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-08-25 23:18:31,404 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:31,404 INFO L512 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:31,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:31,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-08-25 23:18:31,617 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2021-08-25 23:18:31,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:31,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265210192] [2021-08-25 23:18:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:31,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 23:18:31,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:31,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265210192] [2021-08-25 23:18:31,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265210192] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:31,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24808515] [2021-08-25 23:18:31,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 23:18:31,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:31,761 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:31,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-25 23:18:33,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 23:18:33,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:33,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-25 23:18:33,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 23:18:34,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24808515] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:34,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:34,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2021-08-25 23:18:34,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592160381] [2021-08-25 23:18:34,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-25 23:18:34,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-25 23:18:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2021-08-25 23:18:34,239 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand has 14 states, 14 states have (on average 15.0) internal successors, (210), 14 states have internal predecessors, (210), 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-25 23:18:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:34,364 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2021-08-25 23:18:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-25 23:18:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.0) internal successors, (210), 14 states have internal predecessors, (210), 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-25 23:18:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:34,367 INFO L225 Difference]: With dead ends: 1675 [2021-08-25 23:18:34,367 INFO L226 Difference]: Without dead ends: 1121 [2021-08-25 23:18:34,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2021-08-25 23:18:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-08-25 23:18:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2021-08-25 23:18:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.407373271889401) internal successors, (1527), 1085 states have internal predecessors, (1527), 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-25 23:18:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2021-08-25 23:18:34,380 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2021-08-25 23:18:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:34,381 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2021-08-25 23:18:34,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.0) internal successors, (210), 14 states have internal predecessors, (210), 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-25 23:18:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2021-08-25 23:18:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-08-25 23:18:34,382 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:34,382 INFO L512 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:34,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:34,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-08-25 23:18:34,595 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2021-08-25 23:18:34,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:34,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171272708] [2021-08-25 23:18:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:34,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-25 23:18:34,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:34,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171272708] [2021-08-25 23:18:34,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171272708] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:34,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507782931] [2021-08-25 23:18:34,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 23:18:34,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:34,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:34,753 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:34,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-25 23:18:36,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2021-08-25 23:18:36,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:36,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-25 23:18:36,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-25 23:18:37,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507782931] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:37,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:37,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2021-08-25 23:18:37,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894619802] [2021-08-25 23:18:37,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-25 23:18:37,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-25 23:18:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-08-25 23:18:37,501 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 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-25 23:18:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:37,649 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2021-08-25 23:18:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-25 23:18:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 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 257 [2021-08-25 23:18:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:37,652 INFO L225 Difference]: With dead ends: 1287 [2021-08-25 23:18:37,652 INFO L226 Difference]: Without dead ends: 1202 [2021-08-25 23:18:37,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2021-08-25 23:18:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-08-25 23:18:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2021-08-25 23:18:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.404987102321582) internal successors, (1634), 1163 states have internal predecessors, (1634), 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-25 23:18:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2021-08-25 23:18:37,666 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2021-08-25 23:18:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:37,666 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2021-08-25 23:18:37,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 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-25 23:18:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2021-08-25 23:18:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2021-08-25 23:18:37,668 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:37,668 INFO L512 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:37,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:37,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:37,885 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2021-08-25 23:18:37,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:37,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878930337] [2021-08-25 23:18:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:37,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-08-25 23:18:38,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:38,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878930337] [2021-08-25 23:18:38,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878930337] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:38,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278137432] [2021-08-25 23:18:38,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 23:18:38,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:38,060 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:38,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-25 23:18:40,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-25 23:18:40,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:40,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 23:18:40,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2021-08-25 23:18:40,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278137432] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:40,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:40,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2021-08-25 23:18:40,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197171780] [2021-08-25 23:18:40,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-25 23:18:40,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-25 23:18:40,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:40,701 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand has 19 states, 19 states have (on average 15.631578947368421) internal successors, (297), 19 states have internal predecessors, (297), 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-25 23:18:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:41,288 INFO L93 Difference]: Finished difference Result 1312 states and 1833 transitions. [2021-08-25 23:18:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-25 23:18:41,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.631578947368421) internal successors, (297), 19 states have internal predecessors, (297), 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 285 [2021-08-25 23:18:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:41,290 INFO L225 Difference]: With dead ends: 1312 [2021-08-25 23:18:41,290 INFO L226 Difference]: Without dead ends: 680 [2021-08-25 23:18:41,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 469.0ms TimeCoverageRelationStatistics Valid=591, Invalid=1761, Unknown=0, NotChecked=0, Total=2352 [2021-08-25 23:18:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-08-25 23:18:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2021-08-25 23:18:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.378419452887538) internal successors, (907), 658 states have internal predecessors, (907), 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-25 23:18:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2021-08-25 23:18:41,299 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2021-08-25 23:18:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:41,300 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2021-08-25 23:18:41,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.631578947368421) internal successors, (297), 19 states have internal predecessors, (297), 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-25 23:18:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2021-08-25 23:18:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2021-08-25 23:18:41,301 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:41,301 INFO L512 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:41,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-08-25 23:18:41,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-25 23:18:41,517 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2021-08-25 23:18:41,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:41,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562756465] [2021-08-25 23:18:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:41,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 23:18:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-25 23:18:41,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 23:18:41,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562756465] [2021-08-25 23:18:41,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562756465] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:41,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804384997] [2021-08-25 23:18:41,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 23:18:41,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 23:18:41,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 23:18:41,768 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 23:18:41,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-25 23:18:44,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 23:18:44,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 23:18:44,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-25 23:18:44,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 23:18:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-25 23:18:44,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804384997] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 23:18:44,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 23:18:44,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2021-08-25 23:18:44,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065832612] [2021-08-25 23:18:44,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-25 23:18:44,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 23:18:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-25 23:18:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:44,866 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand has 19 states, 19 states have (on average 15.842105263157896) internal successors, (301), 19 states have internal predecessors, (301), 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-25 23:18:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 23:18:45,001 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2021-08-25 23:18:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-25 23:18:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.842105263157896) internal successors, (301), 19 states have internal predecessors, (301), 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 349 [2021-08-25 23:18:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 23:18:45,007 INFO L225 Difference]: With dead ends: 865 [2021-08-25 23:18:45,007 INFO L226 Difference]: Without dead ends: 780 [2021-08-25 23:18:45,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2021-08-25 23:18:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-08-25 23:18:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2021-08-25 23:18:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.377717391304348) internal successors, (1014), 736 states have internal predecessors, (1014), 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-25 23:18:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2021-08-25 23:18:45,016 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2021-08-25 23:18:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 23:18:45,016 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2021-08-25 23:18:45,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.842105263157896) internal successors, (301), 19 states have internal predecessors, (301), 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-25 23:18:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2021-08-25 23:18:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2021-08-25 23:18:45,018 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 23:18:45,018 INFO L512 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 23:18:45,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-25 23:18:45,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-25 23:18:45,237 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 23:18:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 23:18:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2021-08-25 23:18:45,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 23:18:45,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814944424] [2021-08-25 23:18:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 23:18:45,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 23:18:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 23:18:45,778 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 23:18:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 23:18:46,367 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 23:18:46,367 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 23:18:46,367 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 23:18:46,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 23:18:46,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 23:18:46,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 11:18:46 BoogieIcfgContainer [2021-08-25 23:18:46,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 23:18:46,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 23:18:46,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 23:18:46,517 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 23:18:46,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 11:17:38" (3/4) ... [2021-08-25 23:18:46,518 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 23:18:46,661 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 23:18:46,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 23:18:46,663 INFO L168 Benchmark]: Toolchain (without parser) took 69313.86 ms. Allocated memory was 52.4 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 28.8 MB in the beginning and 533.6 MB in the end (delta: -504.9 MB). Peak memory consumption was 671.7 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,663 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 23:18:46,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.17 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 40.8 MB in the end (delta: -12.3 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.22 ms. Allocated memory is still 62.9 MB. Free memory was 40.8 MB in the beginning and 36.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,664 INFO L168 Benchmark]: Boogie Preprocessor took 57.35 ms. Allocated memory is still 62.9 MB. Free memory was 36.2 MB in the beginning and 33.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,665 INFO L168 Benchmark]: RCFGBuilder took 648.54 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 33.1 MB in the beginning and 46.4 MB in the end (delta: -13.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,665 INFO L168 Benchmark]: TraceAbstraction took 68088.37 ms. Allocated memory was 75.5 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 46.0 MB in the beginning and 578.7 MB in the end (delta: -532.7 MB). Peak memory consumption was 619.4 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,665 INFO L168 Benchmark]: Witness Printer took 144.91 ms. Allocated memory is still 1.2 GB. Free memory was 578.7 MB in the beginning and 533.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-08-25 23:18:46,666 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.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.17 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 28.5 MB in the beginning and 40.8 MB in the end (delta: -12.3 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.22 ms. Allocated memory is still 62.9 MB. Free memory was 40.8 MB in the beginning and 36.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.35 ms. Allocated memory is still 62.9 MB. Free memory was 36.2 MB in the beginning and 33.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 648.54 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 33.1 MB in the beginning and 46.4 MB in the end (delta: -13.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 68088.37 ms. Allocated memory was 75.5 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 46.0 MB in the beginning and 578.7 MB in the end (delta: -532.7 MB). Peak memory consumption was 619.4 MB. Max. memory is 16.1 GB. * Witness Printer took 144.91 ms. Allocated memory is still 1.2 GB. Free memory was 578.7 MB in the beginning and 533.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.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: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67909.6ms, OverallIterations: 40, TraceHistogramMax: 35, EmptinessCheckTime: 36.8ms, AutomataDifference: 6437.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 8454 SDtfs, 16899 SDslu, 46330 SDs, 0 SdLazy, 7479 SolverSat, 862 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3662.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4458 GetRequests, 4017 SyntacticMatches, 27 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 3826.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 267.3ms AutomataMinimizationTime, 39 MinimizatonAttempts, 385 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 806.4ms SsaConstructionTime, 3877.3ms SatisfiabilityAnalysisTime, 22316.3ms InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 47754 SizeOfPredicates, 63 NumberOfNonLiveVariables, 22562 ConjunctsInSsa, 698 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 7912/31839 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-25 23:18:46,711 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...