./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/systemc/toy1.cil.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 f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-wip.dd.seqcomp-5fbdf5b [2021-08-29 16:47:45,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 16:47:45,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 16:47:45,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 16:47:45,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 16:47:45,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 16:47:45,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 16:47:45,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 16:47:45,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 16:47:45,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 16:47:45,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 16:47:45,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 16:47:45,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 16:47:45,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 16:47:45,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 16:47:45,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 16:47:45,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 16:47:45,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 16:47:45,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 16:47:45,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 16:47:45,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 16:47:45,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 16:47:45,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 16:47:45,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 16:47:45,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 16:47:45,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 16:47:45,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 16:47:45,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 16:47:45,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 16:47:45,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 16:47:45,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 16:47:45,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 16:47:45,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 16:47:45,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 16:47:45,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 16:47:45,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 16:47:45,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 16:47:45,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 16:47:45,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 16:47:45,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 16:47:45,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 16:47:45,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 16:47:45,437 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 16:47:45,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 16:47:45,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 16:47:45,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 16:47:45,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 16:47:45,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 16:47:45,438 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 16:47:45,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 16:47:45,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 16:47:45,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 16:47:45,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:47:45,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 16:47:45,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 16:47:45,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 16:47:45,442 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 -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2021-08-29 16:47:45,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 16:47:45,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 16:47:45,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 16:47:45,684 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 16:47:45,685 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 16:47:45,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2021-08-29 16:47:45,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249649a43/a9b31551f95e4d159a74ecb17282637b/FLAG436de0233 [2021-08-29 16:47:46,096 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 16:47:46,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2021-08-29 16:47:46,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249649a43/a9b31551f95e4d159a74ecb17282637b/FLAG436de0233 [2021-08-29 16:47:46,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249649a43/a9b31551f95e4d159a74ecb17282637b [2021-08-29 16:47:46,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 16:47:46,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 16:47:46,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 16:47:46,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 16:47:46,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 16:47:46,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453d108d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46, skipping insertion in model container [2021-08-29 16:47:46,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 16:47:46,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 16:47:46,278 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/systemc/toy1.cil.c[393,406] [2021-08-29 16:47:46,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:47:46,366 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 16:47:46,394 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/systemc/toy1.cil.c[393,406] [2021-08-29 16:47:46,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 16:47:46,443 INFO L208 MainTranslator]: Completed translation [2021-08-29 16:47:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46 WrapperNode [2021-08-29 16:47:46,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 16:47:46,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 16:47:46,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 16:47:46,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 16:47:46,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 16:47:46,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 16:47:46,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 16:47:46,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 16:47:46,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 16:47:46,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 16:47:46,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 16:47:46,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 16:47:46,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (1/1) ... [2021-08-29 16:47:46,521 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 16:47:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:47:46,537 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-29 16:47:46,544 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-29 16:47:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 16:47:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 16:47:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 16:47:46,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 16:47:46,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 16:47:46,809 INFO L299 CfgBuilder]: Removed 28 assume(true) statements. [2021-08-29 16:47:46,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:46 BoogieIcfgContainer [2021-08-29 16:47:46,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 16:47:46,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 16:47:46,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 16:47:46,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 16:47:46,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 04:47:46" (1/3) ... [2021-08-29 16:47:46,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543ad2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:47:46, skipping insertion in model container [2021-08-29 16:47:46,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 04:47:46" (2/3) ... [2021-08-29 16:47:46,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543ad2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 04:47:46, skipping insertion in model container [2021-08-29 16:47:46,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:46" (3/3) ... [2021-08-29 16:47:46,817 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2021-08-29 16:47:46,823 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 16:47:46,823 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 16:47:46,861 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 16:47:46,867 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-29 16:47:46,867 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-29 16:47:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 126 states have (on average 1.880952380952381) internal successors, (237), 128 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:46,889 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:46,889 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:46,890 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -895778166, now seen corresponding path program 1 times [2021-08-29 16:47:46,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:46,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598007077] [2021-08-29 16:47:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:46,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:47,066 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-29 16:47:47,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:47,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598007077] [2021-08-29 16:47:47,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598007077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:47,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:47,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:47,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624766386] [2021-08-29 16:47:47,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:47,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:47,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:47,097 INFO L87 Difference]: Start difference. First operand has 129 states, 126 states have (on average 1.880952380952381) internal successors, (237), 128 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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-29 16:47:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:47,344 INFO L93 Difference]: Finished difference Result 250 states and 461 transitions. [2021-08-29 16:47:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:47,345 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 36 [2021-08-29 16:47:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:47,351 INFO L225 Difference]: With dead ends: 250 [2021-08-29 16:47:47,351 INFO L226 Difference]: Without dead ends: 125 [2021-08-29 16:47:47,353 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.11ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:47,355 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 206.59ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:47,356 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 4.30ms Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 206.59ms Time] [2021-08-29 16:47:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-29 16:47:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-08-29 16:47:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.7723577235772359) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2021-08-29 16:47:47,382 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2021-08-29 16:47:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:47,383 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-08-29 16:47:47,383 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-29 16:47:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2021-08-29 16:47:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:47,384 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:47,384 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:47,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 16:47:47,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1597378040, now seen corresponding path program 1 times [2021-08-29 16:47:47,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:47,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869504336] [2021-08-29 16:47:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:47,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:47,425 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-29 16:47:47,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:47,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869504336] [2021-08-29 16:47:47,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869504336] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:47,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:47,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:47,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045396504] [2021-08-29 16:47:47,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:47,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:47,428 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:47,769 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2021-08-29 16:47:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:47:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:47,771 INFO L225 Difference]: With dead ends: 337 [2021-08-29 16:47:47,771 INFO L226 Difference]: Without dead ends: 215 [2021-08-29 16:47:47,772 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:47,773 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 568 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 212.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.66ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 306.12ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:47,773 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 3.66ms Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 306.12ms Time] [2021-08-29 16:47:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-29 16:47:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2021-08-29 16:47:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.7596153846153846) internal successors, (366), 209 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2021-08-29 16:47:47,800 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2021-08-29 16:47:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:47,801 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2021-08-29 16:47:47,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2021-08-29 16:47:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:47,805 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:47,805 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:47,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 16:47:47,805 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -211174646, now seen corresponding path program 1 times [2021-08-29 16:47:47,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:47,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629723056] [2021-08-29 16:47:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:47,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:47,856 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-29 16:47:47,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:47,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629723056] [2021-08-29 16:47:47,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629723056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:47,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:47,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:47,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092598448] [2021-08-29 16:47:47,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:47,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:47,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:47,858 INFO L87 Difference]: Start difference. First operand 210 states and 366 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-29 16:47:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:48,028 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2021-08-29 16:47:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:48,028 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 36 [2021-08-29 16:47:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:48,030 INFO L225 Difference]: With dead ends: 411 [2021-08-29 16:47:48,030 INFO L226 Difference]: Without dead ends: 210 [2021-08-29 16:47:48,030 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:48,031 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.13ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:48,031 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 146.13ms Time] [2021-08-29 16:47:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-29 16:47:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-08-29 16:47:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.7019230769230769) internal successors, (354), 209 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2021-08-29 16:47:48,060 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2021-08-29 16:47:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:48,061 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2021-08-29 16:47:48,061 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-29 16:47:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2021-08-29 16:47:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:48,065 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:48,065 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:48,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 16:47:48,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716090, now seen corresponding path program 1 times [2021-08-29 16:47:48,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:48,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023173177] [2021-08-29 16:47:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:48,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:48,114 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-29 16:47:48,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:48,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023173177] [2021-08-29 16:47:48,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023173177] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:48,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:48,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:48,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666185277] [2021-08-29 16:47:48,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:48,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:48,118 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:48,413 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2021-08-29 16:47:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:48,415 INFO L225 Difference]: With dead ends: 571 [2021-08-29 16:47:48,415 INFO L226 Difference]: Without dead ends: 371 [2021-08-29 16:47:48,418 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:48,421 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 365 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 191.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.39ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 261.20ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:48,421 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 3.39ms Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 261.20ms Time] [2021-08-29 16:47:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-08-29 16:47:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2021-08-29 16:47:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.6875) internal successors, (351), 209 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2021-08-29 16:47:48,431 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2021-08-29 16:47:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:48,431 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2021-08-29 16:47:48,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2021-08-29 16:47:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:48,432 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:48,432 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:48,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 16:47:48,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 181511944, now seen corresponding path program 1 times [2021-08-29 16:47:48,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:48,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072439398] [2021-08-29 16:47:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:48,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:48,468 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-29 16:47:48,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:48,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072439398] [2021-08-29 16:47:48,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072439398] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:48,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:48,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:48,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145305433] [2021-08-29 16:47:48,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:48,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:48,469 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:48,725 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2021-08-29 16:47:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:48,727 INFO L225 Difference]: With dead ends: 574 [2021-08-29 16:47:48,727 INFO L226 Difference]: Without dead ends: 375 [2021-08-29 16:47:48,727 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:48,728 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 364 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.79ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 232.51ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:48,728 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 1.79ms Time], IncrementalHoareTripleChecker [7 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 232.51ms Time] [2021-08-29 16:47:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-08-29 16:47:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2021-08-29 16:47:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.6730769230769231) internal successors, (348), 209 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2021-08-29 16:47:48,742 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2021-08-29 16:47:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:48,742 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2021-08-29 16:47:48,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2021-08-29 16:47:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:48,743 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:48,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:48,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 16:47:48,743 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 243551558, now seen corresponding path program 1 times [2021-08-29 16:47:48,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:48,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320723929] [2021-08-29 16:47:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:48,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:48,769 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-29 16:47:48,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:48,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320723929] [2021-08-29 16:47:48,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320723929] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:48,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:48,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:48,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816247008] [2021-08-29 16:47:48,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:48,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:48,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:48,771 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:49,043 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2021-08-29 16:47:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:49,045 INFO L225 Difference]: With dead ends: 586 [2021-08-29 16:47:49,045 INFO L226 Difference]: Without dead ends: 388 [2021-08-29 16:47:49,045 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:49,046 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 190.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 243.93ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:49,046 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 523 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 243.93ms Time] [2021-08-29 16:47:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-29 16:47:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2021-08-29 16:47:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.644859813084112) internal successors, (352), 215 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2021-08-29 16:47:49,057 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2021-08-29 16:47:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:49,057 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2021-08-29 16:47:49,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2021-08-29 16:47:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:49,058 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:49,058 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:49,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 16:47:49,058 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 384100168, now seen corresponding path program 1 times [2021-08-29 16:47:49,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:49,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462846753] [2021-08-29 16:47:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:49,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:49,082 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-29 16:47:49,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:49,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462846753] [2021-08-29 16:47:49,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462846753] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:49,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:49,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:49,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711820309] [2021-08-29 16:47:49,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:49,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:49,083 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:49,408 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2021-08-29 16:47:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:49,411 INFO L225 Difference]: With dead ends: 737 [2021-08-29 16:47:49,411 INFO L226 Difference]: Without dead ends: 534 [2021-08-29 16:47:49,411 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:49,412 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 229.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.98ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 295.31ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:49,412 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 622 Unknown, 0 Unchecked, 1.98ms Time], IncrementalHoareTripleChecker [8 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 295.31ms Time] [2021-08-29 16:47:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-08-29 16:47:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2021-08-29 16:47:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 349 states have (on average 1.6361031518624642) internal successors, (571), 350 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2021-08-29 16:47:49,432 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2021-08-29 16:47:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:49,433 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2021-08-29 16:47:49,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2021-08-29 16:47:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:49,433 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:49,433 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:49,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 16:47:49,433 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 250086662, now seen corresponding path program 1 times [2021-08-29 16:47:49,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:49,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240557173] [2021-08-29 16:47:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:49,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:49,458 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-29 16:47:49,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:49,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240557173] [2021-08-29 16:47:49,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240557173] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:49,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:49,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:49,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353700394] [2021-08-29 16:47:49,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:49,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:49,460 INFO L87 Difference]: Start difference. First operand 351 states and 571 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-29 16:47:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:49,675 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2021-08-29 16:47:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:49,675 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 36 [2021-08-29 16:47:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:49,677 INFO L225 Difference]: With dead ends: 838 [2021-08-29 16:47:49,677 INFO L226 Difference]: Without dead ends: 511 [2021-08-29 16:47:49,678 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.13ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:49,678 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 149.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.58ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:49,679 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 192.58ms Time] [2021-08-29 16:47:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-08-29 16:47:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2021-08-29 16:47:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 1.6336633663366336) internal successors, (825), 506 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2021-08-29 16:47:49,694 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2021-08-29 16:47:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2021-08-29 16:47:49,695 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-29 16:47:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2021-08-29 16:47:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:49,696 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:49,696 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:49,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 16:47:49,696 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792002, now seen corresponding path program 1 times [2021-08-29 16:47:49,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:49,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674019742] [2021-08-29 16:47:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:49,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:49,735 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-29 16:47:49,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:49,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674019742] [2021-08-29 16:47:49,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674019742] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:49,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:49,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:49,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115055065] [2021-08-29 16:47:49,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:49,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:49,737 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:49,969 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2021-08-29 16:47:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:47:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:49,973 INFO L225 Difference]: With dead ends: 1293 [2021-08-29 16:47:49,973 INFO L226 Difference]: Without dead ends: 803 [2021-08-29 16:47:49,974 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:49,975 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 479 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 196.65ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:49,975 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [10 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 196.65ms Time] [2021-08-29 16:47:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2021-08-29 16:47:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2021-08-29 16:47:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 1.617821782178218) internal successors, (817), 506 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2021-08-29 16:47:49,993 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2021-08-29 16:47:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:49,994 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2021-08-29 16:47:49,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2021-08-29 16:47:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:49,995 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:49,995 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:49,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 16:47:49,996 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -48555900, now seen corresponding path program 1 times [2021-08-29 16:47:49,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:49,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351809867] [2021-08-29 16:47:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:49,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:50,039 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-29 16:47:50,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:50,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351809867] [2021-08-29 16:47:50,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351809867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:50,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:50,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:50,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595035662] [2021-08-29 16:47:50,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:50,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:50,041 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:50,289 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2021-08-29 16:47:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:47:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:50,292 INFO L225 Difference]: With dead ends: 1289 [2021-08-29 16:47:50,292 INFO L226 Difference]: Without dead ends: 805 [2021-08-29 16:47:50,293 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.62ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:50,293 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 461 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.46ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 214.75ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:50,294 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 1.46ms Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 214.75ms Time] [2021-08-29 16:47:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-08-29 16:47:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2021-08-29 16:47:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 1.601980198019802) internal successors, (809), 506 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2021-08-29 16:47:50,311 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2021-08-29 16:47:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:50,312 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2021-08-29 16:47:50,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2021-08-29 16:47:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:50,312 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:50,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:50,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 16:47:50,312 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419578, now seen corresponding path program 1 times [2021-08-29 16:47:50,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:50,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604546939] [2021-08-29 16:47:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:50,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:50,351 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-29 16:47:50,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:50,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604546939] [2021-08-29 16:47:50,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604546939] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:50,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:50,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:50,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486381066] [2021-08-29 16:47:50,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:50,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:50,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:50,355 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:50,600 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2021-08-29 16:47:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 16:47:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 36 [2021-08-29 16:47:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:50,602 INFO L225 Difference]: With dead ends: 1226 [2021-08-29 16:47:50,602 INFO L226 Difference]: Without dead ends: 736 [2021-08-29 16:47:50,603 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:50,604 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 474 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 170.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.54ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 214.39ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:50,604 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 0 Invalid, 395 Unknown, 0 Unchecked, 1.54ms Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 214.39ms Time] [2021-08-29 16:47:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-08-29 16:47:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2021-08-29 16:47:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 1.566003616636528) internal successors, (866), 554 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2021-08-29 16:47:50,621 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2021-08-29 16:47:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:50,622 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2021-08-29 16:47:50,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-29 16:47:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2021-08-29 16:47:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-29 16:47:50,622 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:50,622 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:50,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 16:47:50,623 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225592, now seen corresponding path program 1 times [2021-08-29 16:47:50,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:50,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354486904] [2021-08-29 16:47:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:50,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:50,638 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-29 16:47:50,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:50,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354486904] [2021-08-29 16:47:50,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354486904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:50,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:50,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:50,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556099067] [2021-08-29 16:47:50,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:50,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:50,640 INFO L87 Difference]: Start difference. First operand 555 states and 866 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-29 16:47:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:50,840 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2021-08-29 16:47:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:50,840 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 36 [2021-08-29 16:47:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:50,843 INFO L225 Difference]: With dead ends: 1316 [2021-08-29 16:47:50,843 INFO L226 Difference]: Without dead ends: 775 [2021-08-29 16:47:50,844 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.18ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:50,844 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.58ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 174.18ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:50,844 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.58ms Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 174.18ms Time] [2021-08-29 16:47:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-08-29 16:47:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2021-08-29 16:47:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 770 states have (on average 1.5454545454545454) internal successors, (1190), 771 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2021-08-29 16:47:50,868 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2021-08-29 16:47:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:50,869 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2021-08-29 16:47:50,869 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-29 16:47:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2021-08-29 16:47:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-29 16:47:50,870 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:50,870 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:50,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 16:47:50,870 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash -547155332, now seen corresponding path program 1 times [2021-08-29 16:47:50,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:50,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023005239] [2021-08-29 16:47:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:50,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:50,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:50,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023005239] [2021-08-29 16:47:50,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023005239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:50,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:50,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:50,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88714088] [2021-08-29 16:47:50,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:50,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:50,888 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:51,107 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2021-08-29 16:47:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:51,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-29 16:47:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:51,111 INFO L225 Difference]: With dead ends: 1906 [2021-08-29 16:47:51,111 INFO L226 Difference]: Without dead ends: 1161 [2021-08-29 16:47:51,112 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.10ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,112 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.66ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:51,112 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [6 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 181.66ms Time] [2021-08-29 16:47:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-08-29 16:47:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2021-08-29 16:47:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.5593073593073592) internal successors, (1801), 1156 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2021-08-29 16:47:51,156 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2021-08-29 16:47:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:51,156 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2021-08-29 16:47:51,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2021-08-29 16:47:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-29 16:47:51,157 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:51,158 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:51,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 16:47:51,158 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -299008838, now seen corresponding path program 1 times [2021-08-29 16:47:51,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:51,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769168269] [2021-08-29 16:47:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:51,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:47:51,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:51,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769168269] [2021-08-29 16:47:51,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769168269] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:51,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:51,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:51,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44861834] [2021-08-29 16:47:51,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:51,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,173 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:51,294 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2021-08-29 16:47:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 46 [2021-08-29 16:47:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:51,297 INFO L225 Difference]: With dead ends: 2265 [2021-08-29 16:47:51,298 INFO L226 Difference]: Without dead ends: 1135 [2021-08-29 16:47:51,299 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.11ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,299 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.46ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:51,299 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 87.46ms Time] [2021-08-29 16:47:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2021-08-29 16:47:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2021-08-29 16:47:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.5657546337157988) internal successors, (1774), 1134 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2021-08-29 16:47:51,337 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2021-08-29 16:47:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:51,337 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2021-08-29 16:47:51,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2021-08-29 16:47:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-29 16:47:51,338 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:51,338 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:51,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 16:47:51,338 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash -336670593, now seen corresponding path program 1 times [2021-08-29 16:47:51,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:51,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98977387] [2021-08-29 16:47:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:51,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:51,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:51,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98977387] [2021-08-29 16:47:51,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98977387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:51,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:51,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:51,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182792703] [2021-08-29 16:47:51,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:51,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:51,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:51,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,356 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-29 16:47:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:51,552 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2021-08-29 16:47:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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 47 [2021-08-29 16:47:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:51,558 INFO L225 Difference]: With dead ends: 2891 [2021-08-29 16:47:51,558 INFO L226 Difference]: Without dead ends: 1783 [2021-08-29 16:47:51,559 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.16ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,559 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.60ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 139.99ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:51,560 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 332 Unknown, 0 Unchecked, 0.60ms Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 139.99ms Time] [2021-08-29 16:47:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2021-08-29 16:47:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2021-08-29 16:47:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1777 states have (on average 1.5801913337084974) internal successors, (2808), 1778 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2021-08-29 16:47:51,622 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2021-08-29 16:47:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:51,622 INFO L470 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2021-08-29 16:47:51,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-29 16:47:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2021-08-29 16:47:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-29 16:47:51,623 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:51,623 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:51,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 16:47:51,624 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1825522215, now seen corresponding path program 1 times [2021-08-29 16:47:51,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:51,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577601083] [2021-08-29 16:47:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:51,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:51,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:51,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577601083] [2021-08-29 16:47:51,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577601083] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:51,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:51,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:51,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223468188] [2021-08-29 16:47:51,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:51,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,641 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:51,903 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2021-08-29 16:47:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-08-29 16:47:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:51,912 INFO L225 Difference]: With dead ends: 4794 [2021-08-29 16:47:51,912 INFO L226 Difference]: Without dead ends: 3044 [2021-08-29 16:47:51,914 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.10ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:51,915 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.71ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.15ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:51,915 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 400 Unknown, 0 Unchecked, 0.71ms Time], IncrementalHoareTripleChecker [9 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 167.15ms Time] [2021-08-29 16:47:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2021-08-29 16:47:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2021-08-29 16:47:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3040 states, 3038 states have (on average 1.5941408821593153) internal successors, (4843), 3039 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2021-08-29 16:47:52,046 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2021-08-29 16:47:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:52,046 INFO L470 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2021-08-29 16:47:52,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2021-08-29 16:47:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-29 16:47:52,047 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:52,048 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:52,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 16:47:52,048 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2073668709, now seen corresponding path program 1 times [2021-08-29 16:47:52,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:52,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456174823] [2021-08-29 16:47:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:52,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 16:47:52,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:52,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456174823] [2021-08-29 16:47:52,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456174823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:52,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:52,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:52,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540303056] [2021-08-29 16:47:52,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:52,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:52,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:52,064 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:52,258 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2021-08-29 16:47:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 48 [2021-08-29 16:47:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:52,266 INFO L225 Difference]: With dead ends: 6029 [2021-08-29 16:47:52,267 INFO L226 Difference]: Without dead ends: 3018 [2021-08-29 16:47:52,270 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.09ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:52,270 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.13ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:52,270 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 96.13ms Time] [2021-08-29 16:47:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2021-08-29 16:47:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2021-08-29 16:47:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 3016 states have (on average 1.5971485411140585) internal successors, (4817), 3017 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2021-08-29 16:47:52,381 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2021-08-29 16:47:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:52,382 INFO L470 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2021-08-29 16:47:52,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2021-08-29 16:47:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-29 16:47:52,383 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:52,383 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:52,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 16:47:52,384 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963117268, now seen corresponding path program 1 times [2021-08-29 16:47:52,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:52,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788923853] [2021-08-29 16:47:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:52,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:52,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:52,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788923853] [2021-08-29 16:47:52,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788923853] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:52,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:52,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:52,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314877312] [2021-08-29 16:47:52,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:52,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:52,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:52,407 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:52,756 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2021-08-29 16:47:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-29 16:47:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:52,767 INFO L225 Difference]: With dead ends: 7617 [2021-08-29 16:47:52,768 INFO L226 Difference]: Without dead ends: 3895 [2021-08-29 16:47:52,772 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:52,772 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 173.18ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:52,772 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 343 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [9 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 173.18ms Time] [2021-08-29 16:47:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2021-08-29 16:47:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2021-08-29 16:47:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 3893 states have (on average 1.588235294117647) internal successors, (6183), 3894 states have internal predecessors, (6183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2021-08-29 16:47:52,924 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2021-08-29 16:47:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:52,924 INFO L470 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2021-08-29 16:47:52,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2021-08-29 16:47:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-29 16:47:52,926 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:52,926 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:52,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 16:47:52,926 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1671888881, now seen corresponding path program 1 times [2021-08-29 16:47:52,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:52,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564836902] [2021-08-29 16:47:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:52,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:52,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:52,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564836902] [2021-08-29 16:47:52,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564836902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:52,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:52,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 16:47:52,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099795817] [2021-08-29 16:47:52,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 16:47:52,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 16:47:52,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:52,951 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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-29 16:47:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:53,449 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2021-08-29 16:47:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 16:47:53,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 54 [2021-08-29 16:47:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:53,465 INFO L225 Difference]: With dead ends: 9940 [2021-08-29 16:47:53,465 INFO L226 Difference]: Without dead ends: 6068 [2021-08-29 16:47:53,470 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.17ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 16:47:53,470 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 678 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 204.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 261.35ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:53,470 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 0 Invalid, 565 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [13 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 261.35ms Time] [2021-08-29 16:47:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2021-08-29 16:47:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2021-08-29 16:47:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 4552 states have (on average 1.5536028119507908) internal successors, (7072), 4553 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2021-08-29 16:47:53,683 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2021-08-29 16:47:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:53,683 INFO L470 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2021-08-29 16:47:53,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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-29 16:47:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2021-08-29 16:47:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-29 16:47:53,686 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:53,686 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:53,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 16:47:53,686 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2128152978, now seen corresponding path program 1 times [2021-08-29 16:47:53,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:53,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327565522] [2021-08-29 16:47:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:53,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:53,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:53,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327565522] [2021-08-29 16:47:53,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327565522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:53,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:53,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:53,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287113938] [2021-08-29 16:47:53,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:53,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:53,704 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-29 16:47:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:54,001 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2021-08-29 16:47:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-29 16:47:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:54,013 INFO L225 Difference]: With dead ends: 9431 [2021-08-29 16:47:54,013 INFO L226 Difference]: Without dead ends: 4906 [2021-08-29 16:47:54,018 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:54,019 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 142.89ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:54,020 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 142.89ms Time] [2021-08-29 16:47:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2021-08-29 16:47:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2021-08-29 16:47:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4872 states have (on average 1.5026683087027914) internal successors, (7321), 4873 states have internal predecessors, (7321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2021-08-29 16:47:54,226 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2021-08-29 16:47:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:54,226 INFO L470 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2021-08-29 16:47:54,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-29 16:47:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2021-08-29 16:47:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-29 16:47:54,230 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:54,230 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:54,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 16:47:54,230 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1520792899, now seen corresponding path program 1 times [2021-08-29 16:47:54,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:54,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735793224] [2021-08-29 16:47:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:54,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:54,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:54,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735793224] [2021-08-29 16:47:54,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735793224] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:54,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:54,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:54,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366218716] [2021-08-29 16:47:54,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:54,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:54,253 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:54,583 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2021-08-29 16:47:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-08-29 16:47:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:54,591 INFO L225 Difference]: With dead ends: 10229 [2021-08-29 16:47:54,591 INFO L226 Difference]: Without dead ends: 5396 [2021-08-29 16:47:54,596 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.15ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:54,597 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.96ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:54,597 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 148.96ms Time] [2021-08-29 16:47:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2021-08-29 16:47:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2021-08-29 16:47:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 5346 states have (on average 1.452300785634119) internal successors, (7764), 5347 states have internal predecessors, (7764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2021-08-29 16:47:54,852 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2021-08-29 16:47:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:54,853 INFO L470 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2021-08-29 16:47:54,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2021-08-29 16:47:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-29 16:47:54,857 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:54,857 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:54,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 16:47:54,858 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1973365524, now seen corresponding path program 1 times [2021-08-29 16:47:54,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:54,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937256428] [2021-08-29 16:47:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:54,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 16:47:54,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:54,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937256428] [2021-08-29 16:47:54,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937256428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:54,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:54,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:54,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108336757] [2021-08-29 16:47:54,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:54,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:54,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:54,879 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:55,299 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2021-08-29 16:47:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-29 16:47:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:55,306 INFO L225 Difference]: With dead ends: 11003 [2021-08-29 16:47:55,307 INFO L226 Difference]: Without dead ends: 5716 [2021-08-29 16:47:55,310 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:55,311 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 142.93ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:55,311 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 320 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 142.93ms Time] [2021-08-29 16:47:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2021-08-29 16:47:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2021-08-29 16:47:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5130 states, 5128 states have (on average 1.389625585023401) internal successors, (7126), 5129 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2021-08-29 16:47:55,492 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2021-08-29 16:47:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:55,493 INFO L470 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2021-08-29 16:47:55,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2021-08-29 16:47:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-29 16:47:55,496 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:55,496 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:55,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 16:47:55,497 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 663253701, now seen corresponding path program 1 times [2021-08-29 16:47:55,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:55,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907961270] [2021-08-29 16:47:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:55,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 16:47:55,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:55,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907961270] [2021-08-29 16:47:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907961270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:55,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:55,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:55,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115247186] [2021-08-29 16:47:55,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:55,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:55,519 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:56,008 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2021-08-29 16:47:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:56,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 89 [2021-08-29 16:47:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:56,015 INFO L225 Difference]: With dead ends: 9554 [2021-08-29 16:47:56,016 INFO L226 Difference]: Without dead ends: 4875 [2021-08-29 16:47:56,019 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:56,019 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 431 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 197.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 252.57ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:56,019 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 0 Invalid, 453 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [20 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 252.57ms Time] [2021-08-29 16:47:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2021-08-29 16:47:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2021-08-29 16:47:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4757 states have (on average 1.3378179524910658) internal successors, (6364), 4758 states have internal predecessors, (6364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2021-08-29 16:47:56,196 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2021-08-29 16:47:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:56,196 INFO L470 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2021-08-29 16:47:56,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2021-08-29 16:47:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-29 16:47:56,203 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:56,203 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:56,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-29 16:47:56,203 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1690650567, now seen corresponding path program 1 times [2021-08-29 16:47:56,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:56,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120252057] [2021-08-29 16:47:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:56,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:47:56,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:56,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120252057] [2021-08-29 16:47:56,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120252057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:56,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:56,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:56,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159213985] [2021-08-29 16:47:56,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:56,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:56,223 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:56,540 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2021-08-29 16:47:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:56,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-29 16:47:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:56,546 INFO L225 Difference]: With dead ends: 9073 [2021-08-29 16:47:56,546 INFO L226 Difference]: Without dead ends: 4705 [2021-08-29 16:47:56,549 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.14ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:56,549 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.96ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:56,550 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 127.96ms Time] [2021-08-29 16:47:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2021-08-29 16:47:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2021-08-29 16:47:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4705 states, 4703 states have (on average 1.330640017010419) internal successors, (6258), 4704 states have internal predecessors, (6258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2021-08-29 16:47:56,725 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2021-08-29 16:47:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:56,726 INFO L470 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2021-08-29 16:47:56,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2021-08-29 16:47:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-29 16:47:56,733 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:56,733 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:47:56,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-29 16:47:56,734 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash 762576065, now seen corresponding path program 1 times [2021-08-29 16:47:56,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:56,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891569148] [2021-08-29 16:47:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:56,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:47:56,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:56,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891569148] [2021-08-29 16:47:56,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891569148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:56,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:56,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:56,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459447589] [2021-08-29 16:47:56,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:56,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:56,767 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:57,100 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2021-08-29 16:47:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:57,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-08-29 16:47:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:57,106 INFO L225 Difference]: With dead ends: 8363 [2021-08-29 16:47:57,106 INFO L226 Difference]: Without dead ends: 4627 [2021-08-29 16:47:57,110 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:57,110 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 157.41ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:57,110 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [5 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 157.41ms Time] [2021-08-29 16:47:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2021-08-29 16:47:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2021-08-29 16:47:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4621 states have (on average 1.3064271802640122) internal successors, (6037), 4622 states have internal predecessors, (6037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2021-08-29 16:47:57,363 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2021-08-29 16:47:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:57,363 INFO L470 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2021-08-29 16:47:57,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2021-08-29 16:47:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-29 16:47:57,371 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:57,371 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:47:57,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-29 16:47:57,372 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 843157933, now seen corresponding path program 1 times [2021-08-29 16:47:57,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:57,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396929118] [2021-08-29 16:47:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:57,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-29 16:47:57,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:57,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396929118] [2021-08-29 16:47:57,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396929118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:57,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:57,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:57,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062758144] [2021-08-29 16:47:57,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:57,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:57,398 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-29 16:47:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:57,775 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2021-08-29 16:47:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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 134 [2021-08-29 16:47:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:57,780 INFO L225 Difference]: With dead ends: 8859 [2021-08-29 16:47:57,781 INFO L226 Difference]: Without dead ends: 4622 [2021-08-29 16:47:57,785 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.13ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:57,785 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 140.42ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:57,786 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 305 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 140.42ms Time] [2021-08-29 16:47:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2021-08-29 16:47:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2021-08-29 16:47:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4580 states have (on average 1.3) internal successors, (5954), 4581 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2021-08-29 16:47:58,032 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2021-08-29 16:47:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:58,032 INFO L470 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2021-08-29 16:47:58,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-29 16:47:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2021-08-29 16:47:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-29 16:47:58,038 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:58,039 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:47:58,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-29 16:47:58,039 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 713131341, now seen corresponding path program 1 times [2021-08-29 16:47:58,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:58,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3174047] [2021-08-29 16:47:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:58,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-29 16:47:58,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:58,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3174047] [2021-08-29 16:47:58,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3174047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:58,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:58,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:58,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058038052] [2021-08-29 16:47:58,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:58,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:58,065 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:58,386 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2021-08-29 16:47:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-29 16:47:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:58,390 INFO L225 Difference]: With dead ends: 8798 [2021-08-29 16:47:58,390 INFO L226 Difference]: Without dead ends: 4592 [2021-08-29 16:47:58,393 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.32ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:58,394 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.46ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:58,394 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 128.46ms Time] [2021-08-29 16:47:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2021-08-29 16:47:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2021-08-29 16:47:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4552 states, 4550 states have (on average 1.2929670329670329) internal successors, (5883), 4551 states have internal predecessors, (5883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2021-08-29 16:47:58,570 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2021-08-29 16:47:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:58,571 INFO L470 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2021-08-29 16:47:58,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2021-08-29 16:47:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-29 16:47:58,577 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:58,577 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:58,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-29 16:47:58,577 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -57826629, now seen corresponding path program 1 times [2021-08-29 16:47:58,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:58,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747336110] [2021-08-29 16:47:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:58,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 16:47:58,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:58,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747336110] [2021-08-29 16:47:58,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747336110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:58,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:58,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:58,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737504465] [2021-08-29 16:47:58,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:58,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:58,603 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:58,886 INFO L93 Difference]: Finished difference Result 7397 states and 9599 transitions. [2021-08-29 16:47:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:58,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 137 [2021-08-29 16:47:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:58,890 INFO L225 Difference]: With dead ends: 7397 [2021-08-29 16:47:58,890 INFO L226 Difference]: Without dead ends: 3218 [2021-08-29 16:47:58,893 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:58,894 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.13ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:58,894 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 145.13ms Time] [2021-08-29 16:47:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2021-08-29 16:47:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3214. [2021-08-29 16:47:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3212 states have (on average 1.2655666251556663) internal successors, (4065), 3213 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4065 transitions. [2021-08-29 16:47:59,022 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4065 transitions. Word has length 137 [2021-08-29 16:47:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,022 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4065 transitions. [2021-08-29 16:47:59,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4065 transitions. [2021-08-29 16:47:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-29 16:47:59,026 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,026 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 16:47:59,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-29 16:47:59,026 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -76782736, now seen corresponding path program 1 times [2021-08-29 16:47:59,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308906677] [2021-08-29 16:47:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-29 16:47:59,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:59,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308906677] [2021-08-29 16:47:59,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308906677] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:59,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:59,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 16:47:59,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912714287] [2021-08-29 16:47:59,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 16:47:59,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 16:47:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 16:47:59,054 INFO L87 Difference]: Start difference. First operand 3214 states and 4065 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:59,307 INFO L93 Difference]: Finished difference Result 5216 states and 6609 transitions. [2021-08-29 16:47:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 16:47:59,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 137 [2021-08-29 16:47:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:59,309 INFO L225 Difference]: With dead ends: 5216 [2021-08-29 16:47:59,309 INFO L226 Difference]: Without dead ends: 2075 [2021-08-29 16:47:59,311 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 16:47:59,311 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.73ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:59,312 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 161.73ms Time] [2021-08-29 16:47:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2021-08-29 16:47:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2021-08-29 16:47:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 1.2290961817303045) internal successors, (2543), 2070 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2021-08-29 16:47:59,389 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2021-08-29 16:47:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,389 INFO L470 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2021-08-29 16:47:59,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2021-08-29 16:47:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-29 16:47:59,390 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,391 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:47:59,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-29 16:47:59,391 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash 373327418, now seen corresponding path program 1 times [2021-08-29 16:47:59,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776199085] [2021-08-29 16:47:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-29 16:47:59,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:59,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776199085] [2021-08-29 16:47:59,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776199085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:59,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:59,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:59,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085477073] [2021-08-29 16:47:59,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:59,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:59,413 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:47:59,637 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2021-08-29 16:47:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:47:59,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 176 [2021-08-29 16:47:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:47:59,640 INFO L225 Difference]: With dead ends: 3759 [2021-08-29 16:47:59,640 INFO L226 Difference]: Without dead ends: 2029 [2021-08-29 16:47:59,641 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:59,642 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.39ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.97ms IncrementalHoareTripleChecker+Time [2021-08-29 16:47:59,642 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.39ms Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 119.97ms Time] [2021-08-29 16:47:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2021-08-29 16:47:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2021-08-29 16:47:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1939 states have (on average 1.2093862815884477) internal successors, (2345), 1940 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2021-08-29 16:47:59,722 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2021-08-29 16:47:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:47:59,722 INFO L470 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2021-08-29 16:47:59,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:47:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2021-08-29 16:47:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-08-29 16:47:59,724 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:47:59,724 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:47:59,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-29 16:47:59,724 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:47:59,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:47:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1072981429, now seen corresponding path program 1 times [2021-08-29 16:47:59,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:47:59,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206481506] [2021-08-29 16:47:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:47:59,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:47:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:47:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-29 16:47:59,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:47:59,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206481506] [2021-08-29 16:47:59,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206481506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:47:59,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:47:59,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:47:59,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236097619] [2021-08-29 16:47:59,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:47:59,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:47:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:47:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:47:59,744 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:00,008 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2021-08-29 16:48:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 182 [2021-08-29 16:48:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:00,012 INFO L225 Difference]: With dead ends: 4180 [2021-08-29 16:48:00,012 INFO L226 Difference]: Without dead ends: 2576 [2021-08-29 16:48:00,013 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:00,014 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 159.69ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:00,014 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 305 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 159.69ms Time] [2021-08-29 16:48:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2021-08-29 16:48:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2021-08-29 16:48:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 2217 states have (on average 1.1930536761389265) internal successors, (2645), 2218 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2021-08-29 16:48:00,108 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2021-08-29 16:48:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:00,108 INFO L470 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2021-08-29 16:48:00,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2021-08-29 16:48:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-29 16:48:00,110 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:00,110 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:48:00,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-29 16:48:00,111 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1005799718, now seen corresponding path program 1 times [2021-08-29 16:48:00,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:00,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248610260] [2021-08-29 16:48:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-29 16:48:00,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248610260] [2021-08-29 16:48:00,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248610260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:00,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:00,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:00,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861456339] [2021-08-29 16:48:00,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:00,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:00,133 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:00,325 INFO L93 Difference]: Finished difference Result 3766 states and 4524 transitions. [2021-08-29 16:48:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 185 [2021-08-29 16:48:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:00,327 INFO L225 Difference]: With dead ends: 3766 [2021-08-29 16:48:00,327 INFO L226 Difference]: Without dead ends: 1882 [2021-08-29 16:48:00,328 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.17ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:00,329 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 88.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.97ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:00,329 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 114.97ms Time] [2021-08-29 16:48:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2021-08-29 16:48:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1803. [2021-08-29 16:48:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1801 states have (on average 1.1765685730149917) internal successors, (2119), 1802 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2119 transitions. [2021-08-29 16:48:00,405 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2119 transitions. Word has length 185 [2021-08-29 16:48:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:00,405 INFO L470 AbstractCegarLoop]: Abstraction has 1803 states and 2119 transitions. [2021-08-29 16:48:00,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2119 transitions. [2021-08-29 16:48:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-29 16:48:00,406 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:00,406 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:48:00,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-29 16:48:00,406 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1330592792, now seen corresponding path program 1 times [2021-08-29 16:48:00,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:00,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293865787] [2021-08-29 16:48:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-08-29 16:48:00,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293865787] [2021-08-29 16:48:00,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293865787] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 16:48:00,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 16:48:00,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 16:48:00,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584105948] [2021-08-29 16:48:00,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 16:48:00,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 16:48:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:00,434 INFO L87 Difference]: Start difference. First operand 1803 states and 2119 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:00,687 INFO L93 Difference]: Finished difference Result 1817 states and 2136 transitions. [2021-08-29 16:48:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 16:48:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 185 [2021-08-29 16:48:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:00,689 INFO L225 Difference]: With dead ends: 1817 [2021-08-29 16:48:00,690 INFO L226 Difference]: Without dead ends: 1815 [2021-08-29 16:48:00,691 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.52ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 16:48:00,691 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.93ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.92ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:00,692 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 2.93ms Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 128.92ms Time] [2021-08-29 16:48:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2021-08-29 16:48:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1807. [2021-08-29 16:48:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.1761772853185595) internal successors, (2123), 1806 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2123 transitions. [2021-08-29 16:48:00,789 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2123 transitions. Word has length 185 [2021-08-29 16:48:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:00,790 INFO L470 AbstractCegarLoop]: Abstraction has 1807 states and 2123 transitions. [2021-08-29 16:48:00,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2123 transitions. [2021-08-29 16:48:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-29 16:48:00,791 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:00,791 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:48:00,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-29 16:48:00,792 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1330591190, now seen corresponding path program 1 times [2021-08-29 16:48:00,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:00,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517246923] [2021-08-29 16:48:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:48:00,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 16:48:00,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517246923] [2021-08-29 16:48:00,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517246923] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 16:48:00,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409882705] [2021-08-29 16:48:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:00,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 16:48:00,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 16:48:00,967 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-29 16:48:00,988 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-29 16:48:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 16:48:01,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-29 16:48:01,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 16:48:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:48:01,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 16:48:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-29 16:48:02,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409882705] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 16:48:02,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 16:48:02,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2021-08-29 16:48:02,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954042206] [2021-08-29 16:48:02,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-29 16:48:02,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 16:48:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-29 16:48:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-08-29 16:48:02,222 INFO L87 Difference]: Start difference. First operand 1807 states and 2123 transitions. Second operand has 27 states, 27 states have (on average 16.666666666666668) internal successors, (450), 27 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 16:48:06,052 INFO L93 Difference]: Finished difference Result 6611 states and 7749 transitions. [2021-08-29 16:48:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-29 16:48:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.666666666666668) internal successors, (450), 27 states have internal predecessors, (450), 0 states have call successors, (0), 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 185 [2021-08-29 16:48:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 16:48:06,058 INFO L225 Difference]: With dead ends: 6611 [2021-08-29 16:48:06,058 INFO L226 Difference]: Without dead ends: 5066 [2021-08-29 16:48:06,061 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 973.23ms TimeCoverageRelationStatistics Valid=604, Invalid=4508, Unknown=0, NotChecked=0, Total=5112 [2021-08-29 16:48:06,061 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3504 mSDsluCounter, 6910 mSDsCounter, 0 mSdLazyCounter, 8244 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2195.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.59ms SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 8244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2766.22ms IncrementalHoareTripleChecker+Time [2021-08-29 16:48:06,061 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3504 Valid, 0 Invalid, 8357 Unknown, 0 Unchecked, 21.59ms Time], IncrementalHoareTripleChecker [113 Valid, 8244 Invalid, 0 Unknown, 0 Unchecked, 2766.22ms Time] [2021-08-29 16:48:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2021-08-29 16:48:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 2719. [2021-08-29 16:48:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2717 states have (on average 1.173352962826647) internal successors, (3188), 2718 states have internal predecessors, (3188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3188 transitions. [2021-08-29 16:48:06,200 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3188 transitions. Word has length 185 [2021-08-29 16:48:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 16:48:06,201 INFO L470 AbstractCegarLoop]: Abstraction has 2719 states and 3188 transitions. [2021-08-29 16:48:06,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.666666666666668) internal successors, (450), 27 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 16:48:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3188 transitions. [2021-08-29 16:48:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-08-29 16:48:06,202 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 16:48:06,202 INFO L513 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 16:48:06,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-29 16:48:06,404 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,SelfDestructingSolverStorable33 [2021-08-29 16:48:06,405 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 16:48:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 16:48:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1701344696, now seen corresponding path program 1 times [2021-08-29 16:48:06,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 16:48:06,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479268963] [2021-08-29 16:48:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 16:48:06,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 16:48:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:48:06,419 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 16:48:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 16:48:06,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 16:48:06,483 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 16:48:06,483 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-08-29 16:48:06,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-08-29 16:48:06,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-29 16:48:06,492 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 16:48:06,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 04:48:06 BoogieIcfgContainer [2021-08-29 16:48:06,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 16:48:06,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 16:48:06,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 16:48:06,629 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 16:48:06,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 04:47:46" (3/4) ... [2021-08-29 16:48:06,631 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 16:48:06,719 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 16:48:06,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 16:48:06,719 INFO L158 Benchmark]: Toolchain (without parser) took 20590.02ms. Allocated memory was 54.5MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 30.4MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,720 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 16:48:06,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.2MB in the beginning and 47.1MB in the end (delta: -16.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.22ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 44.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,720 INFO L158 Benchmark]: Boogie Preprocessor took 38.75ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,721 INFO L158 Benchmark]: RCFGBuilder took 298.73ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 44.0MB in the end (delta: -1.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,721 INFO L158 Benchmark]: TraceAbstraction took 19815.77ms. Allocated memory was 67.1MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 43.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 949.6MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,721 INFO L158 Benchmark]: Witness Printer took 90.26ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-08-29 16:48:06,722 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.15ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.2MB in the beginning and 47.1MB in the end (delta: -16.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.22ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 44.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.75ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 42.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.73ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 44.0MB in the end (delta: -1.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19815.77ms. Allocated memory was 67.1MB in the beginning and 1.5GB in the end (delta: 1.5GB). Free memory was 43.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 949.6MB. Max. memory is 16.1GB. * Witness Printer took 90.26ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L141] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L186] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L231] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L563] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L579] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L584] COND TRUE (int )e_wl == 0 [L585] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L589] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L590] COND TRUE (int )e_wl == 1 [L591] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L607] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L608] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L616] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L617] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L625] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L626] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L634] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L639] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L644] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L649] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L654] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L659] COND TRUE (int )e_wl == 1 [L660] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L664] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L141] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L144] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L159] COND TRUE ! processed [L160] data += 1 [L161] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L162] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L163] COND TRUE (int )e_g == 1 [L164] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L171] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L152] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L154] c1_st = 2 [L155] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L186] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L189] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] COND TRUE ! processed [L205] data += 1 [L206] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L207] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L208] COND TRUE (int )e_g == 1 [L209] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L216] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L197] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L199] c2_st = 2 [L200] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L231] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L234] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L249] c_t = data [L250] c_req_up = 1 [L251] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L242] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L244] wb_st = 2 [L245] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE c != c_t [L554] c = c_t [L555] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L559] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L563] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L564] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L569] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L574] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L579] COND TRUE (int )e_c == 0 [L580] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L584] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L589] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L598] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L607] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L608] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L616] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L617] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L625] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L626] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L634] COND TRUE (int )e_c == 1 [L635] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L639] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L644] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L649] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L654] COND TRUE (int )e_c == 1 [L655] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L667] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L670] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L673] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L676] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L545] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L303] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L312] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L321] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L351] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L366] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L265] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L274] COND TRUE (int )e_e == 1 [L275] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L283] e_e = 2 [L284] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L298] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L300] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L114] COND TRUE d == t + 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19630.06ms, OverallIterations: 35, TraceHistogramMax: 6, EmptinessCheckTime: 82.86ms, AutomataDifference: 13391.25ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.91ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11229 SdHoareTripleChecker+Valid, 8629.46ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11229 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6702.65ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11033 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19791 IncrementalHoareTripleChecker+Invalid, 20108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 0 mSDtfsCounter, 19791 mSolverCounterSat, 61.54ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 1090.21ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred in iteration=21, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 3322.08ms AutomataMinimizationTime, 34 MinimizatonAttempts, 6747 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 80.80ms SsaConstructionTime, 269.29ms SatisfiabilityAnalysisTime, 1904.72ms InterpolantComputationTime, 3190 NumberOfCodeBlocks, 3190 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3153 ConstructedInterpolants, 0 QuantifiedInterpolants, 6953 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 36 InterpolantComputations, 33 PerfectInterpolantSequences, 1006/1132 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-29 16:48:06,750 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...