./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/bist_cell.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 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:02:31,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:02:31,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:02:32,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:02:32,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:02:32,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:02:32,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:02:32,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:02:32,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:02:32,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:02:32,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:02:32,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:02:32,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:02:32,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:02:32,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:02:32,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:02:32,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:02:32,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:02:32,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:02:32,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:02:32,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:02:32,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:02:32,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:02:32,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:02:32,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:02:32,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:02:32,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:02:32,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:02:32,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:02:32,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:02:32,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:02:32,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:02:32,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:02:32,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:02:32,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:02:32,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:02:32,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:02:32,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:02:32,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:02:32,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:02:32,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:02:32,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:02:32,069 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:02:32,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:02:32,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:02:32,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:02:32,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:02:32,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:02:32,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:02:32,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:02:32,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:02:32,072 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:02:32,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:02:32,083 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:02:32,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:02:32,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:02:32,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:02:32,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:02:32,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:02:32,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:02:32,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:02:32,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:02:32,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:02:32,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:02:32,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:02:32,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:02:32,085 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 -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2021-08-26 09:02:32,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:02:32,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:02:32,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:02:32,352 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:02:32,352 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:02:32,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-08-26 09:02:32,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78264f3e6/e55032fbfd574505bc4de71311186f0b/FLAGe23edfd02 [2021-08-26 09:02:32,765 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:02:32,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-08-26 09:02:32,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78264f3e6/e55032fbfd574505bc4de71311186f0b/FLAGe23edfd02 [2021-08-26 09:02:32,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78264f3e6/e55032fbfd574505bc4de71311186f0b [2021-08-26 09:02:32,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:02:32,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:02:32,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:02:32,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:02:32,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:02:32,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:02:32" (1/1) ... [2021-08-26 09:02:32,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48594eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:32, skipping insertion in model container [2021-08-26 09:02:32,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:02:32" (1/1) ... [2021-08-26 09:02:32,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:02:32,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:02:32,925 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/bist_cell.cil.c[334,347] [2021-08-26 09:02:32,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:02:33,015 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:02:33,031 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/bist_cell.cil.c[334,347] [2021-08-26 09:02:33,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:02:33,069 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:02:33,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33 WrapperNode [2021-08-26 09:02:33,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:02:33,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:02:33,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:02:33,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:02:33,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:02:33,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:02:33,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:02:33,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:02:33,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:02:33,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:02:33,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:02:33,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:02:33,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (1/1) ... [2021-08-26 09:02:33,140 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:02:33,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:33,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 09:02:33,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 09:02:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:02:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:02:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:02:33,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:02:33,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:02:33,665 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-08-26 09:02:33,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:33 BoogieIcfgContainer [2021-08-26 09:02:33,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:02:33,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:02:33,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:02:33,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:02:33,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:02:32" (1/3) ... [2021-08-26 09:02:33,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37053826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:02:33, skipping insertion in model container [2021-08-26 09:02:33,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:33" (2/3) ... [2021-08-26 09:02:33,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37053826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:02:33, skipping insertion in model container [2021-08-26 09:02:33,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:33" (3/3) ... [2021-08-26 09:02:33,673 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-08-26 09:02:33,677 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:02:33,677 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 09:02:33,715 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:02:33,720 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 09:02:33,720 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 09:02:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 09:02:33,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:33,739 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:33,739 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-08-26 09:02:33,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:33,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177825904] [2021-08-26 09:02:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:33,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:33,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:33,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177825904] [2021-08-26 09:02:33,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177825904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:33,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:33,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:33,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933127744] [2021-08-26 09:02:33,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:33,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:33,938 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 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 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:33,990 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-08-26 09:02:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-26 09:02:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,000 INFO L225 Difference]: With dead ends: 210 [2021-08-26 09:02:34,000 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 09:02:34,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 09:02:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 09:02:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 103 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-26 09:02:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-08-26 09:02:34,042 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-08-26 09:02:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,043 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-08-26 09:02:34,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-08-26 09:02:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 09:02:34,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:02:34,047 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-08-26 09:02:34,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91396474] [2021-08-26 09:02:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91396474] [2021-08-26 09:02:34,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91396474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:34,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482553327] [2021-08-26 09:02:34,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:34,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,124 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,139 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-08-26 09:02:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:34,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-08-26 09:02:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,141 INFO L225 Difference]: With dead ends: 199 [2021-08-26 09:02:34,141 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 09:02:34,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 09:02:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 09:02:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 103 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-26 09:02:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-08-26 09:02:34,147 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-08-26 09:02:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,147 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-08-26 09:02:34,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-08-26 09:02:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-26 09:02:34,150 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:02:34,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-08-26 09:02:34,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052606110] [2021-08-26 09:02:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052606110] [2021-08-26 09:02:34,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052606110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:34,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933605956] [2021-08-26 09:02:34,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:34,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,219 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,246 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-08-26 09:02:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:34,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-08-26 09:02:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,251 INFO L225 Difference]: With dead ends: 196 [2021-08-26 09:02:34,252 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 09:02:34,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 09:02:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 09:02:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 103 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-08-26 09:02:34,260 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-08-26 09:02:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,261 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-08-26 09:02:34,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-08-26 09:02:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-26 09:02:34,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:02:34,266 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-08-26 09:02:34,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616307287] [2021-08-26 09:02:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616307287] [2021-08-26 09:02:34,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616307287] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:34,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650652190] [2021-08-26 09:02:34,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:34,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,300 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,312 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-08-26 09:02:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-08-26 09:02:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,313 INFO L225 Difference]: With dead ends: 193 [2021-08-26 09:02:34,313 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 09:02:34,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 09:02:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 09:02:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 103 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-08-26 09:02:34,318 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-08-26 09:02:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,325 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-08-26 09:02:34,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-08-26 09:02:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-26 09:02:34,329 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,329 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:02:34,330 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-08-26 09:02:34,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440470946] [2021-08-26 09:02:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440470946] [2021-08-26 09:02:34,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440470946] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:34,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704555103] [2021-08-26 09:02:34,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:34,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,392 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,442 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-08-26 09:02:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:34,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-26 09:02:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,444 INFO L225 Difference]: With dead ends: 271 [2021-08-26 09:02:34,444 INFO L226 Difference]: Without dead ends: 191 [2021-08-26 09:02:34,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-08-26 09:02:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-08-26 09:02:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 187 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-08-26 09:02:34,467 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-08-26 09:02:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,467 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-08-26 09:02:34,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-08-26 09:02:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-26 09:02:34,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:02:34,470 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-08-26 09:02:34,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002786940] [2021-08-26 09:02:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002786940] [2021-08-26 09:02:34,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002786940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 09:02:34,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429433382] [2021-08-26 09:02:34,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:02:34,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:02:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:02:34,559 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,674 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-08-26 09:02:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 09:02:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-26 09:02:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,676 INFO L225 Difference]: With dead ends: 444 [2021-08-26 09:02:34,676 INFO L226 Difference]: Without dead ends: 261 [2021-08-26 09:02:34,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.2ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:02:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-26 09:02:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-08-26 09:02:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-08-26 09:02:34,688 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-08-26 09:02:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,688 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-08-26 09:02:34,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-08-26 09:02:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-26 09:02:34,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 09:02:34,689 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,690 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-08-26 09:02:34,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597641640] [2021-08-26 09:02:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597641640] [2021-08-26 09:02:34,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597641640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:34,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507206967] [2021-08-26 09:02:34,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:34,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,727 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,771 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-08-26 09:02:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-26 09:02:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,773 INFO L225 Difference]: With dead ends: 408 [2021-08-26 09:02:34,773 INFO L226 Difference]: Without dead ends: 271 [2021-08-26 09:02:34,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-26 09:02:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-08-26 09:02:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-08-26 09:02:34,779 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-08-26 09:02:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,779 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-08-26 09:02:34,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-08-26 09:02:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-26 09:02:34,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,780 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:02:34,780 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-08-26 09:02:34,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330865210] [2021-08-26 09:02:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:34,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:34,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330865210] [2021-08-26 09:02:34,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330865210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:34,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:34,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 09:02:34,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688659860] [2021-08-26 09:02:34,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:02:34,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:02:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:02:34,846 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:34,970 INFO L93 Difference]: Finished difference Result 749 states and 1171 transitions. [2021-08-26 09:02:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 09:02:34,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-08-26 09:02:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:34,973 INFO L225 Difference]: With dead ends: 749 [2021-08-26 09:02:34,973 INFO L226 Difference]: Without dead ends: 554 [2021-08-26 09:02:34,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-26 09:02:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-26 09:02:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 280. [2021-08-26 09:02:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 279 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-08-26 09:02:34,985 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-08-26 09:02:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:34,986 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-08-26 09:02:34,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-08-26 09:02:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 09:02:34,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:34,987 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:34,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:02:34,987 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:34,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-08-26 09:02:34,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:34,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91327379] [2021-08-26 09:02:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:34,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91327379] [2021-08-26 09:02:35,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91327379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:35,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265715372] [2021-08-26 09:02:35,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:35,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,028 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,074 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-08-26 09:02:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-26 09:02:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,077 INFO L225 Difference]: With dead ends: 563 [2021-08-26 09:02:35,077 INFO L226 Difference]: Without dead ends: 332 [2021-08-26 09:02:35,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-26 09:02:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-08-26 09:02:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.5391849529780564) internal successors, (491), 319 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-08-26 09:02:35,088 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-08-26 09:02:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,088 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-08-26 09:02:35,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-08-26 09:02:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-26 09:02:35,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,089 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:02:35,090 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-08-26 09:02:35,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762982664] [2021-08-26 09:02:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762982664] [2021-08-26 09:02:35,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762982664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:35,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934670188] [2021-08-26 09:02:35,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:35,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,131 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,158 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-08-26 09:02:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-26 09:02:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,159 INFO L225 Difference]: With dead ends: 567 [2021-08-26 09:02:35,159 INFO L226 Difference]: Without dead ends: 284 [2021-08-26 09:02:35,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-08-26 09:02:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-08-26 09:02:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4946619217081851) internal successors, (420), 281 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-08-26 09:02:35,166 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-08-26 09:02:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,167 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-08-26 09:02:35,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-08-26 09:02:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-26 09:02:35,167 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,167 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:02:35,168 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-08-26 09:02:35,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496423630] [2021-08-26 09:02:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496423630] [2021-08-26 09:02:35,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496423630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:35,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196831903] [2021-08-26 09:02:35,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:35,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:35,213 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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-26 09:02:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,266 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-08-26 09:02:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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-26 09:02:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,268 INFO L225 Difference]: With dead ends: 811 [2021-08-26 09:02:35,268 INFO L226 Difference]: Without dead ends: 580 [2021-08-26 09:02:35,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-08-26 09:02:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-08-26 09:02:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 573 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-08-26 09:02:35,284 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-08-26 09:02:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,284 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-08-26 09:02:35,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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-26 09:02:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-08-26 09:02:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-26 09:02:35,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,286 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:02:35,286 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-08-26 09:02:35,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937295638] [2021-08-26 09:02:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937295638] [2021-08-26 09:02:35,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937295638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:02:35,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328354481] [2021-08-26 09:02:35,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:02:35,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:02:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:35,346 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-26 09:02:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,412 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-08-26 09:02:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:02:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-26 09:02:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,414 INFO L225 Difference]: With dead ends: 1097 [2021-08-26 09:02:35,415 INFO L226 Difference]: Without dead ends: 574 [2021-08-26 09:02:35,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:02:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-08-26 09:02:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-08-26 09:02:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.469458987783595) internal successors, (842), 573 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-08-26 09:02:35,449 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-08-26 09:02:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,450 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-08-26 09:02:35,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-26 09:02:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-08-26 09:02:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-26 09:02:35,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,451 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:02:35,452 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-08-26 09:02:35,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375062497] [2021-08-26 09:02:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375062497] [2021-08-26 09:02:35,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375062497] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:35,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74748678] [2021-08-26 09:02:35,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:35,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,482 INFO L87 Difference]: Start difference. First operand 574 states and 842 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-26 09:02:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,545 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-08-26 09:02:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:35,546 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-26 09:02:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,550 INFO L225 Difference]: With dead ends: 1592 [2021-08-26 09:02:35,550 INFO L226 Difference]: Without dead ends: 1069 [2021-08-26 09:02:35,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-08-26 09:02:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-08-26 09:02:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4598290598290597) internal successors, (854), 585 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-08-26 09:02:35,581 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-08-26 09:02:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,581 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-08-26 09:02:35,581 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-26 09:02:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-08-26 09:02:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 09:02:35,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,583 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:02:35,583 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-08-26 09:02:35,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917271336] [2021-08-26 09:02:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917271336] [2021-08-26 09:02:35,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917271336] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:02:35,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278665065] [2021-08-26 09:02:35,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:02:35,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:02:35,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:35,638 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,697 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-08-26 09:02:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:02:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-26 09:02:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,699 INFO L225 Difference]: With dead ends: 1105 [2021-08-26 09:02:35,699 INFO L226 Difference]: Without dead ends: 570 [2021-08-26 09:02:35,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:02:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-08-26 09:02:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-08-26 09:02:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.437609841827768) internal successors, (818), 569 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-08-26 09:02:35,723 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-08-26 09:02:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,723 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-08-26 09:02:35,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-08-26 09:02:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-26 09:02:35,724 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,724 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:02:35,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-08-26 09:02:35,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704442342] [2021-08-26 09:02:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704442342] [2021-08-26 09:02:35,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704442342] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:35,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643597092] [2021-08-26 09:02:35,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:35,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,750 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,813 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-08-26 09:02:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-08-26 09:02:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,816 INFO L225 Difference]: With dead ends: 1592 [2021-08-26 09:02:35,816 INFO L226 Difference]: Without dead ends: 1073 [2021-08-26 09:02:35,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-08-26 09:02:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-08-26 09:02:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4315424610051992) internal successors, (826), 577 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-08-26 09:02:35,844 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-08-26 09:02:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,844 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-08-26 09:02:35,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-08-26 09:02:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-26 09:02:35,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,845 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:02:35,845 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-08-26 09:02:35,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321056491] [2021-08-26 09:02:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321056491] [2021-08-26 09:02:35,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321056491] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:35,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:35,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:35,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629722287] [2021-08-26 09:02:35,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:35,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,880 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:35,929 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-08-26 09:02:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-08-26 09:02:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:35,931 INFO L225 Difference]: With dead ends: 1311 [2021-08-26 09:02:35,931 INFO L226 Difference]: Without dead ends: 784 [2021-08-26 09:02:35,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-08-26 09:02:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-08-26 09:02:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.449645390070922) internal successors, (1022), 705 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-08-26 09:02:35,959 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-08-26 09:02:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:35,960 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-08-26 09:02:35,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-08-26 09:02:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-26 09:02:35,960 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:35,961 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:35,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 09:02:35,961 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-08-26 09:02:35,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:35,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825590930] [2021-08-26 09:02:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:35,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:35,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825590930] [2021-08-26 09:02:35,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825590930] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:02:35,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993298028] [2021-08-26 09:02:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:35,991 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:35,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:02:36,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 09:02:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:36,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:02:36,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:02:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:36,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993298028] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:36,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:02:36,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-26 09:02:36,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322277266] [2021-08-26 09:02:36,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:36,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:36,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:36,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:36,593 INFO L87 Difference]: Start difference. First operand 706 states and 1022 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-26 09:02:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:36,649 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-08-26 09:02:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:36,650 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 92 [2021-08-26 09:02:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:36,651 INFO L225 Difference]: With dead ends: 1341 [2021-08-26 09:02:36,652 INFO L226 Difference]: Without dead ends: 686 [2021-08-26 09:02:36,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-08-26 09:02:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-08-26 09:02:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.429197080291971) internal successors, (979), 685 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-08-26 09:02:36,682 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-08-26 09:02:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:36,683 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-08-26 09:02:36,683 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-26 09:02:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-08-26 09:02:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-26 09:02:36,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:36,684 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:36,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 09:02:36,903 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,SelfDestructingSolverStorable16 [2021-08-26 09:02:36,904 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:36,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-08-26 09:02:36,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:36,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499327097] [2021-08-26 09:02:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:36,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:36,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:36,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499327097] [2021-08-26 09:02:36,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499327097] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:02:36,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787055927] [2021-08-26 09:02:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:36,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:36,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:02:36,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:02:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:37,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:02:37,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:02:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:37,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787055927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:37,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:02:37,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-26 09:02:37,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558561104] [2021-08-26 09:02:37,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:37,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:37,374 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:37,442 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-08-26 09:02:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:37,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 93 [2021-08-26 09:02:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:37,446 INFO L225 Difference]: With dead ends: 2025 [2021-08-26 09:02:37,447 INFO L226 Difference]: Without dead ends: 1364 [2021-08-26 09:02:37,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-08-26 09:02:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-08-26 09:02:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4125) internal successors, (1921), 1360 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-08-26 09:02:37,498 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-08-26 09:02:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:37,498 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-08-26 09:02:37,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-08-26 09:02:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-26 09:02:37,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:37,500 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:37,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:02:37,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 09:02:37,721 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-08-26 09:02:37,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:37,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050247508] [2021-08-26 09:02:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:37,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:37,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:37,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050247508] [2021-08-26 09:02:37,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050247508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:37,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:37,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:37,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378033612] [2021-08-26 09:02:37,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:37,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:37,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:37,739 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:37,815 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-08-26 09:02:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 93 [2021-08-26 09:02:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:37,819 INFO L225 Difference]: With dead ends: 2736 [2021-08-26 09:02:37,819 INFO L226 Difference]: Without dead ends: 1463 [2021-08-26 09:02:37,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-08-26 09:02:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-08-26 09:02:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1462 states have (on average 1.4008207934336525) internal successors, (2048), 1462 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-08-26 09:02:37,871 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-08-26 09:02:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:37,871 INFO L470 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-08-26 09:02:37,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-08-26 09:02:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-26 09:02:37,873 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:37,873 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:37,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 09:02:37,873 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-08-26 09:02:37,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:37,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286395985] [2021-08-26 09:02:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:37,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:37,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:37,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286395985] [2021-08-26 09:02:37,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286395985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:37,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:37,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:37,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054222359] [2021-08-26 09:02:37,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:37,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:37,892 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:37,944 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-08-26 09:02:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 93 [2021-08-26 09:02:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:37,948 INFO L225 Difference]: With dead ends: 2354 [2021-08-26 09:02:37,949 INFO L226 Difference]: Without dead ends: 973 [2021-08-26 09:02:37,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-08-26 09:02:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-08-26 09:02:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.389917695473251) internal successors, (1351), 972 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-08-26 09:02:38,006 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-08-26 09:02:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:38,006 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-08-26 09:02:38,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-08-26 09:02:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:02:38,007 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:38,007 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:38,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 09:02:38,008 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-08-26 09:02:38,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:38,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532014510] [2021-08-26 09:02:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:38,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:38,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532014510] [2021-08-26 09:02:38,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532014510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:38,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:38,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:38,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212023193] [2021-08-26 09:02:38,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:38,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:38,045 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:38,085 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-08-26 09:02:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 94 [2021-08-26 09:02:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:38,087 INFO L225 Difference]: With dead ends: 1258 [2021-08-26 09:02:38,087 INFO L226 Difference]: Without dead ends: 373 [2021-08-26 09:02:38,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-08-26 09:02:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-08-26 09:02:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3548387096774193) internal successors, (504), 372 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-08-26 09:02:38,103 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-08-26 09:02:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:38,103 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-08-26 09:02:38,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-08-26 09:02:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:02:38,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:38,104 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:38,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 09:02:38,104 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-08-26 09:02:38,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:38,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202834091] [2021-08-26 09:02:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:38,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:38,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202834091] [2021-08-26 09:02:38,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202834091] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:02:38,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598973394] [2021-08-26 09:02:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:38,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:02:38,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:02:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:02:38,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:02:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:38,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598973394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:38,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:02:38,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-26 09:02:38,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615590574] [2021-08-26 09:02:38,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:38,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:38,523 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:38,560 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-08-26 09:02:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 94 [2021-08-26 09:02:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:38,563 INFO L225 Difference]: With dead ends: 1059 [2021-08-26 09:02:38,563 INFO L226 Difference]: Without dead ends: 732 [2021-08-26 09:02:38,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-08-26 09:02:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-08-26 09:02:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.3365384615384615) internal successors, (973), 728 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-08-26 09:02:38,589 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-08-26 09:02:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:38,589 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-08-26 09:02:38,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-08-26 09:02:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:02:38,591 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:38,591 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:38,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 09:02:38,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:38,810 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-08-26 09:02:38,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:38,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004742646] [2021-08-26 09:02:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:38,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:38,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004742646] [2021-08-26 09:02:38,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004742646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:38,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:38,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:38,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943123008] [2021-08-26 09:02:38,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:38,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:38,827 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:38,866 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-08-26 09:02:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 94 [2021-08-26 09:02:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:38,869 INFO L225 Difference]: With dead ends: 1382 [2021-08-26 09:02:38,869 INFO L226 Difference]: Without dead ends: 811 [2021-08-26 09:02:38,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-08-26 09:02:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-08-26 09:02:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.317283950617284) internal successors, (1067), 810 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-08-26 09:02:38,895 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-08-26 09:02:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:38,895 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-08-26 09:02:38,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-08-26 09:02:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-08-26 09:02:38,897 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:38,897 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:38,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 09:02:38,897 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-08-26 09:02:38,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:38,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634604717] [2021-08-26 09:02:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:38,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:38,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634604717] [2021-08-26 09:02:38,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634604717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:38,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:38,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:38,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092040681] [2021-08-26 09:02:38,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:38,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:38,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:38,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:38,914 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:38,943 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-08-26 09:02:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:38,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 94 [2021-08-26 09:02:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:38,944 INFO L225 Difference]: With dead ends: 1208 [2021-08-26 09:02:38,945 INFO L226 Difference]: Without dead ends: 551 [2021-08-26 09:02:38,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-26 09:02:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-08-26 09:02:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-08-26 09:02:38,962 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-08-26 09:02:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:38,963 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-08-26 09:02:38,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-08-26 09:02:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:02:38,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:38,964 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:38,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 09:02:38,964 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-08-26 09:02:38,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:38,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874465295] [2021-08-26 09:02:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:38,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:38,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:38,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874465295] [2021-08-26 09:02:38,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874465295] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:38,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:38,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:38,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451769576] [2021-08-26 09:02:38,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:38,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:38,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:39,000 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:39,020 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-08-26 09:02:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 09:02:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:39,022 INFO L225 Difference]: With dead ends: 820 [2021-08-26 09:02:39,022 INFO L226 Difference]: Without dead ends: 427 [2021-08-26 09:02:39,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-08-26 09:02:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-08-26 09:02:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.272300469483568) internal successors, (542), 426 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-08-26 09:02:39,048 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-08-26 09:02:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:39,048 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-08-26 09:02:39,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-08-26 09:02:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:02:39,051 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:39,051 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:39,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 09:02:39,051 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-08-26 09:02:39,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:39,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024149149] [2021-08-26 09:02:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:39,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:39,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:39,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024149149] [2021-08-26 09:02:39,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024149149] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:02:39,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006895210] [2021-08-26 09:02:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:39,077 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:39,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:02:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 09:02:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:39,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:02:39,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:02:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:02:39,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006895210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:39,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:02:39,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-26 09:02:39,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481772384] [2021-08-26 09:02:39,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:39,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:39,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:39,458 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:39,511 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-08-26 09:02:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 09:02:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:39,513 INFO L225 Difference]: With dead ends: 1163 [2021-08-26 09:02:39,513 INFO L226 Difference]: Without dead ends: 822 [2021-08-26 09:02:39,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-08-26 09:02:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-08-26 09:02:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.2506112469437654) internal successors, (1023), 818 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-08-26 09:02:39,542 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-08-26 09:02:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:39,543 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-08-26 09:02:39,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-08-26 09:02:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:02:39,544 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:39,544 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:39,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 09:02:39,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-26 09:02:39,763 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-08-26 09:02:39,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:39,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500832473] [2021-08-26 09:02:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:39,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:39,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:39,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500832473] [2021-08-26 09:02:39,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500832473] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:02:39,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498809622] [2021-08-26 09:02:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:39,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:02:39,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:39,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:02:39,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 09:02:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:40,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 09:02:40,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:02:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:40,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498809622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:40,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:02:40,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-26 09:02:40,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488868318] [2021-08-26 09:02:40,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:40,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:40,349 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:40,396 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-08-26 09:02:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-08-26 09:02:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:40,399 INFO L225 Difference]: With dead ends: 1704 [2021-08-26 09:02:40,399 INFO L226 Difference]: Without dead ends: 1054 [2021-08-26 09:02:40,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-08-26 09:02:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-08-26 09:02:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2542037586547972) internal successors, (1268), 1011 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-08-26 09:02:40,445 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-08-26 09:02:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:40,445 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-08-26 09:02:40,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-08-26 09:02:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:02:40,446 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:40,447 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:40,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 09:02:40,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-26 09:02:40,663 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:40,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-08-26 09:02:40,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:40,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474856239] [2021-08-26 09:02:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:40,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:40,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:40,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474856239] [2021-08-26 09:02:40,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474856239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:40,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:40,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:40,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876896405] [2021-08-26 09:02:40,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:40,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:40,688 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:40,745 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-08-26 09:02:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-08-26 09:02:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:40,750 INFO L225 Difference]: With dead ends: 2540 [2021-08-26 09:02:40,750 INFO L226 Difference]: Without dead ends: 1698 [2021-08-26 09:02:40,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-08-26 09:02:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-08-26 09:02:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.249757045675413) internal successors, (1286), 1029 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-08-26 09:02:40,790 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-08-26 09:02:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:40,790 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-08-26 09:02:40,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-08-26 09:02:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:02:40,792 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:40,792 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:40,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 09:02:40,792 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:02:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-08-26 09:02:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:40,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138232471] [2021-08-26 09:02:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:40,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:40,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:40,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138232471] [2021-08-26 09:02:40,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138232471] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:40,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:40,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:02:40,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669570456] [2021-08-26 09:02:40,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:02:40,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:40,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:02:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:40,822 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:40,873 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-08-26 09:02:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:02:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-08-26 09:02:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:40,874 INFO L225 Difference]: With dead ends: 1285 [2021-08-26 09:02:40,874 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 09:02:40,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:02:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 09:02:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 09:02:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 09:02:40,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-08-26 09:02:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:40,876 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 09:02:40,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 09:02:40,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 09:02:40,880 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:02:40,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 09:02:40,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 09:02:40,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:40,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:41,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:02:43,762 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 404) no Hoare annotation was computed. [2021-08-26 09:02:43,762 INFO L853 garLoopResultBuilder]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse15 (= ~b1_ev~0 1)) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (= ~d0_ev~0 1)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-08-26 09:02:43,762 INFO L853 garLoopResultBuilder]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,762 INFO L853 garLoopResultBuilder]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,762 INFO L853 garLoopResultBuilder]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,763 INFO L853 garLoopResultBuilder]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,763 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,763 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,763 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 118) no Hoare annotation was computed. [2021-08-26 09:02:43,763 INFO L857 garLoopResultBuilder]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2021-08-26 09:02:43,763 INFO L857 garLoopResultBuilder]: For program point L71(lines 43 93) no Hoare annotation was computed. [2021-08-26 09:02:43,763 INFO L860 garLoopResultBuilder]: At program point L501(lines 485 503) the Hoare annotation is: true [2021-08-26 09:02:43,764 INFO L853 garLoopResultBuilder]: At program point L303(lines 271 308) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L204(lines 204 210) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L853 garLoopResultBuilder]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (<= 2 ~d1_ev~0) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0)) [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L853 garLoopResultBuilder]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 117) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 179) no Hoare annotation was computed. [2021-08-26 09:02:43,764 INFO L857 garLoopResultBuilder]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L853 garLoopResultBuilder]: At program point L406(lines 395 408) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,765 INFO L853 garLoopResultBuilder]: At program point L407(lines 391 409) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-08-26 09:02:43,765 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L853 garLoopResultBuilder]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (= ~d0_req_up~0 1)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (= ~d1_req_up~0 1)) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~b1_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b1_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-26 09:02:43,766 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,766 INFO L857 garLoopResultBuilder]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L853 garLoopResultBuilder]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse6 (= ~b1_ev~0 0)) (.cse8 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse15 (= ~d0_ev~0 0)) (.cse5 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (not (= ~b0_req_up~0 1))) (.cse14 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2021-08-26 09:02:43,767 INFO L853 garLoopResultBuilder]: At program point L447(lines 493 499) the Hoare annotation is: (and (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,767 INFO L857 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-08-26 09:02:43,768 INFO L857 garLoopResultBuilder]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2021-08-26 09:02:43,768 INFO L857 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-08-26 09:02:43,768 INFO L853 garLoopResultBuilder]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse9 (= ~b1_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~z_val~0 0)) (.cse17 (= ~d0_ev~0 1)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15))) [2021-08-26 09:02:43,768 INFO L857 garLoopResultBuilder]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-08-26 09:02:43,768 INFO L853 garLoopResultBuilder]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,768 INFO L853 garLoopResultBuilder]: At program point L482(lines 453 484) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-08-26 09:02:43,768 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 09:02:43,768 INFO L853 garLoopResultBuilder]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse17 (= ~b1_ev~0 0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse18 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (<= 2 ~d1_ev~0)) (.cse9 (not (= ~b1_val_t~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (= ~d1_req_up~0 1)) (.cse15 (not (= ~b0_req_up~0 1))) (.cse16 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse18 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-08-26 09:02:43,769 INFO L853 garLoopResultBuilder]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L53(lines 43 93) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-08-26 09:02:43,769 INFO L853 garLoopResultBuilder]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse9 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15))) [2021-08-26 09:02:43,770 INFO L853 garLoopResultBuilder]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,770 INFO L853 garLoopResultBuilder]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,770 INFO L853 garLoopResultBuilder]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse17 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse8 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= |ULTIMATE.start_is_method1_triggered_#res| 0))) (.cse14 (not (= ~d0_val_t~0 0))) (.cse15 (not (= ~b1_val~0 0))) (.cse16 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2021-08-26 09:02:43,770 INFO L853 garLoopResultBuilder]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= |ULTIMATE.start_is_method1_triggered_#res| 0)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,770 INFO L857 garLoopResultBuilder]: For program point L189(lines 189 194) no Hoare annotation was computed. [2021-08-26 09:02:43,770 INFO L857 garLoopResultBuilder]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2021-08-26 09:02:43,770 INFO L857 garLoopResultBuilder]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2021-08-26 09:02:43,770 INFO L857 garLoopResultBuilder]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2021-08-26 09:02:43,770 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L291(lines 291 298) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L853 garLoopResultBuilder]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-26 09:02:43,771 INFO L853 garLoopResultBuilder]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-08-26 09:02:43,771 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L853 garLoopResultBuilder]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 265) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 134) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2021-08-26 09:02:43,772 INFO L857 garLoopResultBuilder]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L860 garLoopResultBuilder]: At program point L493(lines 493 499) the Hoare annotation is: true [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2021-08-26 09:02:43,773 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-08-26 09:02:43,774 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 119) no Hoare annotation was computed. [2021-08-26 09:02:43,774 INFO L857 garLoopResultBuilder]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2021-08-26 09:02:43,774 INFO L853 garLoopResultBuilder]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-26 09:02:43,774 INFO L853 garLoopResultBuilder]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-08-26 09:02:43,777 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:02:43,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:02:43 BoogieIcfgContainer [2021-08-26 09:02:43,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:02:43,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:02:43,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:02:43,823 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:02:43,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:33" (3/4) ... [2021-08-26 09:02:43,825 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 09:02:43,844 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 09:02:43,845 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 09:02:43,845 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:02:43,846 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:02:43,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-08-26 09:02:43,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-08-26 09:02:43,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-08-26 09:02:43,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:02:43,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:02:43,908 INFO L168 Benchmark]: Toolchain (without parser) took 11119.83 ms. Allocated memory was 65.0 MB in the beginning and 323.0 MB in the end (delta: 257.9 MB). Free memory was 45.3 MB in the beginning and 280.4 MB in the end (delta: -235.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,909 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 65.0 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:02:43,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.30 ms. Allocated memory is still 65.0 MB. Free memory was 45.2 MB in the beginning and 46.1 MB in the end (delta: -867.8 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 65.0 MB. Free memory was 46.1 MB in the beginning and 43.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,909 INFO L168 Benchmark]: Boogie Preprocessor took 32.57 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 41.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,910 INFO L168 Benchmark]: RCFGBuilder took 535.78 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 41.7 MB in the beginning and 64.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,910 INFO L168 Benchmark]: TraceAbstraction took 10153.39 ms. Allocated memory was 83.9 MB in the beginning and 323.0 MB in the end (delta: 239.1 MB). Free memory was 63.9 MB in the beginning and 290.9 MB in the end (delta: -227.0 MB). Peak memory consumption was 200.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,910 INFO L168 Benchmark]: Witness Printer took 84.88 ms. Allocated memory is still 323.0 MB. Free memory was 290.9 MB in the beginning and 280.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 09:02:43,911 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.10 ms. Allocated memory is still 65.0 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 281.30 ms. Allocated memory is still 65.0 MB. Free memory was 45.2 MB in the beginning and 46.1 MB in the end (delta: -867.8 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 65.0 MB. Free memory was 46.1 MB in the beginning and 43.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.57 ms. Allocated memory is still 65.0 MB. Free memory was 43.5 MB in the beginning and 41.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 535.78 ms. Allocated memory was 65.0 MB in the beginning and 83.9 MB in the end (delta: 18.9 MB). Free memory was 41.7 MB in the beginning and 64.3 MB in the end (delta: -22.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10153.39 ms. Allocated memory was 83.9 MB in the beginning and 323.0 MB in the end (delta: 239.1 MB). Free memory was 63.9 MB in the beginning and 290.9 MB in the end (delta: -227.0 MB). Peak memory consumption was 200.2 MB. Max. memory is 16.1 GB. * Witness Printer took 84.88 ms. Allocated memory is still 323.0 MB. Free memory was 290.9 MB in the beginning and 280.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10063.2ms, OverallIterations: 29, TraceHistogramMax: 2, EmptinessCheckTime: 41.1ms, AutomataDifference: 1652.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2880.6ms, InitialAbstractionConstructionTime: 10.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4786 SDtfs, 2809 SDslu, 5283 SDs, 0 SdLazy, 418 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 456.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 285.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 657.9ms AutomataMinimizationTime, 29 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3769 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63912 FormulaSimplificationTreeSizeReduction, 444.1ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 4734 FormulaSimplificationTreeSizeReductionInter, 2422.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 164.6ms SsaConstructionTime, 433.6ms SatisfiabilityAnalysisTime, 2292.1ms InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 5233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(tmp == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) && 1 == b1_req_up - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((0 == z_val_t && !(1 == b1_req_up)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((b0_req_up == 1 && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && d0_val_t == b0_val_t) && z_ev == 2) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && d1_val_t == b0_val_t) && 2 <= d0_ev) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) RESULT: Ultimate proved your program to be correct! [2021-08-26 09:02:43,955 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...