./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.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/transmitter.02.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 5c6676c90977e408adf03f66d7ae0804453cb34e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:13:41,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:13:41,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:13:41,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:13:41,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:13:41,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:13:41,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:13:41,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:13:41,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:13:41,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:13:41,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:13:41,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:13:41,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:13:41,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:13:41,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:13:41,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:13:41,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:13:41,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:13:41,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:13:41,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:13:41,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:13:41,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:13:41,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:13:41,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:13:41,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:13:41,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:13:41,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:13:41,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:13:41,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:13:41,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:13:41,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:13:41,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:13:41,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:13:41,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:13:41,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:13:41,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:13:41,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:13:41,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:13:41,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:13:41,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:13:41,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:13:41,516 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:13:41,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:13:41,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:13:41,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:13:41,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:13:41,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:13:41,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:13:41,540 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:13:41,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:13:41,541 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:13:41,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:13:41,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:13:41,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:13:41,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:13:41,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:13:41,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:13:41,547 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:13:41,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:13:41,548 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:13:41,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:13:41,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:13:41,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:13:41,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:13:41,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:13:41,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:13:41,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:13:41,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:13:41,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:13:41,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:13:41,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:13:41,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:13:41,550 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 -> 5c6676c90977e408adf03f66d7ae0804453cb34e [2021-08-26 09:13:41,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:13:41,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:13:41,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:13:41,965 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:13:41,966 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:13:41,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-08-26 09:13:42,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637ac4d18/20bafe9cca374558be9a84755ffc00e7/FLAG8600a7c1b [2021-08-26 09:13:42,549 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:13:42,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-08-26 09:13:42,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637ac4d18/20bafe9cca374558be9a84755ffc00e7/FLAG8600a7c1b [2021-08-26 09:13:43,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637ac4d18/20bafe9cca374558be9a84755ffc00e7 [2021-08-26 09:13:43,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:13:43,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:13:43,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:13:43,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:13:43,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:13:43,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477b3deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43, skipping insertion in model container [2021-08-26 09:13:43,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:13:43,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:13:43,158 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/transmitter.02.cil.c[401,414] [2021-08-26 09:13:43,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:13:43,212 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:13:43,247 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/transmitter.02.cil.c[401,414] [2021-08-26 09:13:43,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:13:43,299 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:13:43,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43 WrapperNode [2021-08-26 09:13:43,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:13:43,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:13:43,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:13:43,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:13:43,307 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:13:43" (1/1) ... [2021-08-26 09:13:43,314 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:13:43" (1/1) ... [2021-08-26 09:13:43,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:13:43,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:13:43,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:13:43,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:13:43,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:13:43,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:13:43,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:13:43,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:13:43,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (1/1) ... [2021-08-26 09:13:43,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:13:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:13:43,426 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:13:43,462 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:13:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:13:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:13:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:13:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:13:44,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:13:44,218 INFO L299 CfgBuilder]: Removed 94 assume(true) statements. [2021-08-26 09:13:44,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:44 BoogieIcfgContainer [2021-08-26 09:13:44,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:13:44,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:13:44,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:13:44,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:13:44,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:13:43" (1/3) ... [2021-08-26 09:13:44,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c208b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:44, skipping insertion in model container [2021-08-26 09:13:44,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:43" (2/3) ... [2021-08-26 09:13:44,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c208b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:44, skipping insertion in model container [2021-08-26 09:13:44,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:44" (3/3) ... [2021-08-26 09:13:44,235 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-08-26 09:13:44,240 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:13:44,240 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 09:13:44,279 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:13:44,284 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:13:44,284 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 09:13:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 190 states have (on average 1.5842105263157895) internal successors, (301), 191 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:44,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:44,309 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] [2021-08-26 09:13:44,309 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2021-08-26 09:13:44,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:44,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433416244] [2021-08-26 09:13:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:44,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:44,473 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:13:44,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:44,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433416244] [2021-08-26 09:13:44,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433416244] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:44,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:44,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:44,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323258484] [2021-08-26 09:13:44,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:44,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:44,495 INFO L87 Difference]: Start difference. First operand has 192 states, 190 states have (on average 1.5842105263157895) internal successors, (301), 191 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:44,551 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2021-08-26 09:13:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:44,564 INFO L225 Difference]: With dead ends: 379 [2021-08-26 09:13:44,565 INFO L226 Difference]: Without dead ends: 188 [2021-08-26 09:13:44,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-26 09:13:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-08-26 09:13:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:13:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2021-08-26 09:13:44,649 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2021-08-26 09:13:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:44,650 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2021-08-26 09:13:44,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2021-08-26 09:13:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:44,653 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:44,653 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] [2021-08-26 09:13:44,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:13:44,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2021-08-26 09:13:44,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:44,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219719022] [2021-08-26 09:13:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:44,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:44,744 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:13:44,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:44,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219719022] [2021-08-26 09:13:44,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219719022] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:44,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:44,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:44,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170107438] [2021-08-26 09:13:44,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:44,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:44,755 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:44,858 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2021-08-26 09:13:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:44,861 INFO L225 Difference]: With dead ends: 498 [2021-08-26 09:13:44,863 INFO L226 Difference]: Without dead ends: 317 [2021-08-26 09:13:44,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-08-26 09:13:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2021-08-26 09:13:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4872611464968153) internal successors, (467), 314 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:13:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2021-08-26 09:13:44,912 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2021-08-26 09:13:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:44,913 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2021-08-26 09:13:44,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2021-08-26 09:13:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:44,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:44,918 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] [2021-08-26 09:13:44,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:13:44,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2021-08-26 09:13:44,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:44,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119003956] [2021-08-26 09:13:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:44,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:44,992 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:13:44,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:44,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119003956] [2021-08-26 09:13:44,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119003956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:44,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:44,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:44,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630848646] [2021-08-26 09:13:44,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:44,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:45,000 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,047 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2021-08-26 09:13:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,055 INFO L225 Difference]: With dead ends: 622 [2021-08-26 09:13:45,055 INFO L226 Difference]: Without dead ends: 315 [2021-08-26 09:13:45,058 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:13:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-26 09:13:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-26 09:13:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4617834394904459) internal successors, (459), 314 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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:13:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2021-08-26 09:13:45,085 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2021-08-26 09:13:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,086 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2021-08-26 09:13:45,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2021-08-26 09:13:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,087 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,087 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] [2021-08-26 09:13:45,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:13:45,087 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2021-08-26 09:13:45,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706632328] [2021-08-26 09:13:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,118 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:13:45,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706632328] [2021-08-26 09:13:45,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706632328] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:45,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137158849] [2021-08-26 09:13:45,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:45,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:45,121 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,157 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2021-08-26 09:13:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,159 INFO L225 Difference]: With dead ends: 621 [2021-08-26 09:13:45,159 INFO L226 Difference]: Without dead ends: 315 [2021-08-26 09:13:45,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:13:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-26 09:13:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-26 09:13:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4363057324840764) internal successors, (451), 314 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:13:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2021-08-26 09:13:45,171 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2021-08-26 09:13:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,171 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2021-08-26 09:13:45,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2021-08-26 09:13:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,172 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] [2021-08-26 09:13:45,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:13:45,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2021-08-26 09:13:45,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981483943] [2021-08-26 09:13:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,202 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:13:45,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981483943] [2021-08-26 09:13:45,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981483943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:45,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959370195] [2021-08-26 09:13:45,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:45,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:45,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:45,205 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,242 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2021-08-26 09:13:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,244 INFO L225 Difference]: With dead ends: 620 [2021-08-26 09:13:45,244 INFO L226 Difference]: Without dead ends: 315 [2021-08-26 09:13:45,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:13:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-26 09:13:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-26 09:13:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.39171974522293) internal successors, (437), 314 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:13:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2021-08-26 09:13:45,257 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2021-08-26 09:13:45,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,257 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2021-08-26 09:13:45,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2021-08-26 09:13:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,258 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] [2021-08-26 09:13:45,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:13:45,259 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2021-08-26 09:13:45,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100048453] [2021-08-26 09:13:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,300 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:13:45,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100048453] [2021-08-26 09:13:45,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100048453] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:45,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341621910] [2021-08-26 09:13:45,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:45,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:45,304 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,359 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2021-08-26 09:13:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,362 INFO L225 Difference]: With dead ends: 619 [2021-08-26 09:13:45,362 INFO L226 Difference]: Without dead ends: 315 [2021-08-26 09:13:45,363 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:13:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-26 09:13:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-26 09:13:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.3471337579617835) internal successors, (423), 314 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:13:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2021-08-26 09:13:45,377 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2021-08-26 09:13:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,378 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2021-08-26 09:13:45,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2021-08-26 09:13:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,379 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,379 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] [2021-08-26 09:13:45,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 09:13:45,379 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2021-08-26 09:13:45,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595324043] [2021-08-26 09:13:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,438 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:13:45,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595324043] [2021-08-26 09:13:45,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595324043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:13:45,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924921329] [2021-08-26 09:13:45,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:13:45,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:13:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:45,441 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,608 INFO L93 Difference]: Finished difference Result 1006 states and 1358 transitions. [2021-08-26 09:13:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:13:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,611 INFO L225 Difference]: With dead ends: 1006 [2021-08-26 09:13:45,611 INFO L226 Difference]: Without dead ends: 709 [2021-08-26 09:13:45,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:13:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-08-26 09:13:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 327. [2021-08-26 09:13:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.322085889570552) internal successors, (431), 326 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:13:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2021-08-26 09:13:45,630 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 49 [2021-08-26 09:13:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,630 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2021-08-26 09:13:45,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2021-08-26 09:13:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,631 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] [2021-08-26 09:13:45,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:13:45,631 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 145495590, now seen corresponding path program 1 times [2021-08-26 09:13:45,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537802568] [2021-08-26 09:13:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,680 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:13:45,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537802568] [2021-08-26 09:13:45,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537802568] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:13:45,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272354511] [2021-08-26 09:13:45,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:13:45,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:13:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:45,685 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:45,799 INFO L93 Difference]: Finished difference Result 870 states and 1159 transitions. [2021-08-26 09:13:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:13:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:45,802 INFO L225 Difference]: With dead ends: 870 [2021-08-26 09:13:45,802 INFO L226 Difference]: Without dead ends: 568 [2021-08-26 09:13:45,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:13:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-08-26 09:13:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 333. [2021-08-26 09:13:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.2981927710843373) internal successors, (431), 332 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:13:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2021-08-26 09:13:45,833 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 49 [2021-08-26 09:13:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:45,833 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2021-08-26 09:13:45,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2021-08-26 09:13:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:45,834 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:45,834 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] [2021-08-26 09:13:45,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:13:45,835 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2068723624, now seen corresponding path program 1 times [2021-08-26 09:13:45,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:45,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880483458] [2021-08-26 09:13:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:45,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:45,895 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:13:45,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:45,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880483458] [2021-08-26 09:13:45,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880483458] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:45,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:45,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:13:45,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171718763] [2021-08-26 09:13:45,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:13:45,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:13:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:45,898 INFO L87 Difference]: Start difference. First operand 333 states and 431 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:46,020 INFO L93 Difference]: Finished difference Result 895 states and 1173 transitions. [2021-08-26 09:13:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 09:13:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:46,027 INFO L225 Difference]: With dead ends: 895 [2021-08-26 09:13:46,027 INFO L226 Difference]: Without dead ends: 594 [2021-08-26 09:13:46,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:13:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-08-26 09:13:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 339. [2021-08-26 09:13:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.2751479289940828) internal successors, (431), 338 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:13:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2021-08-26 09:13:46,055 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 49 [2021-08-26 09:13:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:46,055 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2021-08-26 09:13:46,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2021-08-26 09:13:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:46,056 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:46,056 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] [2021-08-26 09:13:46,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:13:46,057 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1803541846, now seen corresponding path program 1 times [2021-08-26 09:13:46,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:46,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81014512] [2021-08-26 09:13:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:46,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:46,118 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:13:46,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:46,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81014512] [2021-08-26 09:13:46,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81014512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:46,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:46,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:46,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156361010] [2021-08-26 09:13:46,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:46,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:46,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:46,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:46,121 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:46,194 INFO L93 Difference]: Finished difference Result 919 states and 1163 transitions. [2021-08-26 09:13:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:46,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-08-26 09:13:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:46,199 INFO L225 Difference]: With dead ends: 919 [2021-08-26 09:13:46,199 INFO L226 Difference]: Without dead ends: 617 [2021-08-26 09:13:46,200 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:13:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-08-26 09:13:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 595. [2021-08-26 09:13:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.2474747474747474) internal successors, (741), 594 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:13:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 741 transitions. [2021-08-26 09:13:46,235 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 741 transitions. Word has length 49 [2021-08-26 09:13:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:46,237 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 741 transitions. [2021-08-26 09:13:46,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 741 transitions. [2021-08-26 09:13:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-26 09:13:46,238 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:46,238 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] [2021-08-26 09:13:46,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:13:46,238 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1362638081, now seen corresponding path program 1 times [2021-08-26 09:13:46,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:46,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168704166] [2021-08-26 09:13:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:46,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:46,293 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:13:46,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:46,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168704166] [2021-08-26 09:13:46,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168704166] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:46,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:46,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:46,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872891838] [2021-08-26 09:13:46,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:46,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:46,296 INFO L87 Difference]: Start difference. First operand 595 states and 741 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:13:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:46,397 INFO L93 Difference]: Finished difference Result 1513 states and 1891 transitions. [2021-08-26 09:13:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-08-26 09:13:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:46,402 INFO L225 Difference]: With dead ends: 1513 [2021-08-26 09:13:46,402 INFO L226 Difference]: Without dead ends: 988 [2021-08-26 09:13:46,403 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:13:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-08-26 09:13:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2021-08-26 09:13:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.2365482233502538) internal successors, (1218), 985 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:13:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1218 transitions. [2021-08-26 09:13:46,479 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1218 transitions. Word has length 50 [2021-08-26 09:13:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:46,479 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 1218 transitions. [2021-08-26 09:13:46,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:13:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1218 transitions. [2021-08-26 09:13:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 09:13:46,480 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:46,481 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] [2021-08-26 09:13:46,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:13:46,481 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash -497328611, now seen corresponding path program 1 times [2021-08-26 09:13:46,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:46,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915603416] [2021-08-26 09:13:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:46,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:46,519 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:13:46,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:46,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915603416] [2021-08-26 09:13:46,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915603416] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:46,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:46,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:46,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806909549] [2021-08-26 09:13:46,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:46,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:46,526 INFO L87 Difference]: Start difference. First operand 986 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:13:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:46,665 INFO L93 Difference]: Finished difference Result 2794 states and 3457 transitions. [2021-08-26 09:13:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-26 09:13:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:46,675 INFO L225 Difference]: With dead ends: 2794 [2021-08-26 09:13:46,676 INFO L226 Difference]: Without dead ends: 1858 [2021-08-26 09:13:46,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:13:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2021-08-26 09:13:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1842. [2021-08-26 09:13:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.2232482346550788) internal successors, (2252), 1841 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states 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:13:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2252 transitions. [2021-08-26 09:13:46,794 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2252 transitions. Word has length 51 [2021-08-26 09:13:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:46,795 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2252 transitions. [2021-08-26 09:13:46,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:13:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2252 transitions. [2021-08-26 09:13:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-26 09:13:46,797 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:46,797 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:46,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:13:46,798 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -798137423, now seen corresponding path program 1 times [2021-08-26 09:13:46,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:46,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914362070] [2021-08-26 09:13:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:46,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:46,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:46,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914362070] [2021-08-26 09:13:46,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914362070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:46,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:46,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:46,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289257868] [2021-08-26 09:13:46,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:46,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:46,846 INFO L87 Difference]: Start difference. First operand 1842 states and 2252 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:13:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:47,073 INFO L93 Difference]: Finished difference Result 5392 states and 6581 transitions. [2021-08-26 09:13:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:47,074 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:13:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:47,084 INFO L225 Difference]: With dead ends: 5392 [2021-08-26 09:13:47,085 INFO L226 Difference]: Without dead ends: 2716 [2021-08-26 09:13:47,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2021-08-26 09:13:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2021-08-26 09:13:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.2191528545119705) internal successors, (3310), 2715 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states 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:13:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3310 transitions. [2021-08-26 09:13:47,244 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3310 transitions. Word has length 66 [2021-08-26 09:13:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:47,244 INFO L470 AbstractCegarLoop]: Abstraction has 2716 states and 3310 transitions. [2021-08-26 09:13:47,244 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:13:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3310 transitions. [2021-08-26 09:13:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 09:13:47,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:47,249 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:47,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:13:47,250 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash 280255658, now seen corresponding path program 1 times [2021-08-26 09:13:47,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:47,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747226999] [2021-08-26 09:13:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:47,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 09:13:47,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:47,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747226999] [2021-08-26 09:13:47,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747226999] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:47,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:47,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 09:13:47,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504969036] [2021-08-26 09:13:47,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:47,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:47,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:47,294 INFO L87 Difference]: Start difference. First operand 2716 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:47,514 INFO L93 Difference]: Finished difference Result 6156 states and 7487 transitions. [2021-08-26 09:13:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:47,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-26 09:13:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:47,528 INFO L225 Difference]: With dead ends: 6156 [2021-08-26 09:13:47,528 INFO L226 Difference]: Without dead ends: 3476 [2021-08-26 09:13:47,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2021-08-26 09:13:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3452. [2021-08-26 09:13:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.2077658649666763) internal successors, (4168), 3451 states have internal predecessors, (4168), 0 states have call successors, (0), 0 states 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:13:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4168 transitions. [2021-08-26 09:13:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4168 transitions. Word has length 89 [2021-08-26 09:13:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:47,763 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 4168 transitions. [2021-08-26 09:13:47,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4168 transitions. [2021-08-26 09:13:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-26 09:13:47,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:47,767 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:47,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:13:47,767 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2021-08-26 09:13:47,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:47,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146367776] [2021-08-26 09:13:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:47,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:47,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:47,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146367776] [2021-08-26 09:13:47,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146367776] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:47,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:47,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:47,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792247002] [2021-08-26 09:13:47,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:47,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:47,801 INFO L87 Difference]: Start difference. First operand 3452 states and 4168 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:13:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:48,024 INFO L93 Difference]: Finished difference Result 6102 states and 7406 transitions. [2021-08-26 09:13:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:13:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:48,038 INFO L225 Difference]: With dead ends: 6102 [2021-08-26 09:13:48,038 INFO L226 Difference]: Without dead ends: 3454 [2021-08-26 09:13:48,043 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:13:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2021-08-26 09:13:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2021-08-26 09:13:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.1990727325412924) internal successors, (4138), 3451 states have internal predecessors, (4138), 0 states have call successors, (0), 0 states 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:13:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4138 transitions. [2021-08-26 09:13:48,240 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4138 transitions. Word has length 92 [2021-08-26 09:13:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:48,240 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 4138 transitions. [2021-08-26 09:13:48,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:13:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4138 transitions. [2021-08-26 09:13:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-26 09:13:48,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:48,244 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:48,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:13:48,245 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1737719815, now seen corresponding path program 1 times [2021-08-26 09:13:48,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:48,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413998975] [2021-08-26 09:13:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:48,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:48,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:48,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413998975] [2021-08-26 09:13:48,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413998975] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:48,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:48,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:48,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719739780] [2021-08-26 09:13:48,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:48,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:48,283 INFO L87 Difference]: Start difference. First operand 3452 states and 4138 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:13:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:48,475 INFO L93 Difference]: Finished difference Result 5607 states and 6744 transitions. [2021-08-26 09:13:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2021-08-26 09:13:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:48,488 INFO L225 Difference]: With dead ends: 5607 [2021-08-26 09:13:48,488 INFO L226 Difference]: Without dead ends: 3452 [2021-08-26 09:13:48,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2021-08-26 09:13:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3438. [2021-08-26 09:13:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.1812627291242364) internal successors, (4060), 3437 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states 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:13:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4060 transitions. [2021-08-26 09:13:48,665 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4060 transitions. Word has length 115 [2021-08-26 09:13:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:48,665 INFO L470 AbstractCegarLoop]: Abstraction has 3438 states and 4060 transitions. [2021-08-26 09:13:48,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:13:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4060 transitions. [2021-08-26 09:13:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-26 09:13:48,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:48,669 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:48,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 09:13:48,670 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2021-08-26 09:13:48,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:48,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255858609] [2021-08-26 09:13:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:48,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 09:13:48,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:48,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255858609] [2021-08-26 09:13:48,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255858609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:48,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:48,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:48,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737097684] [2021-08-26 09:13:48,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:48,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:48,700 INFO L87 Difference]: Start difference. First operand 3438 states and 4060 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:13:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:48,980 INFO L93 Difference]: Finished difference Result 7668 states and 8983 transitions. [2021-08-26 09:13:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:48,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-08-26 09:13:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:48,991 INFO L225 Difference]: With dead ends: 7668 [2021-08-26 09:13:48,992 INFO L226 Difference]: Without dead ends: 2540 [2021-08-26 09:13:48,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2021-08-26 09:13:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2462. [2021-08-26 09:13:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2461 states have (on average 1.1312474603819584) internal successors, (2784), 2461 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states 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:13:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2784 transitions. [2021-08-26 09:13:49,146 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2784 transitions. Word has length 116 [2021-08-26 09:13:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:49,147 INFO L470 AbstractCegarLoop]: Abstraction has 2462 states and 2784 transitions. [2021-08-26 09:13:49,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:13:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2784 transitions. [2021-08-26 09:13:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-26 09:13:49,150 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:49,150 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:49,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 09:13:49,151 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2021-08-26 09:13:49,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:49,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100422712] [2021-08-26 09:13:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:49,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:49,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:49,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100422712] [2021-08-26 09:13:49,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100422712] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:49,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:49,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:49,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418953429] [2021-08-26 09:13:49,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:49,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:49,184 INFO L87 Difference]: Start difference. First operand 2462 states and 2784 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:49,329 INFO L93 Difference]: Finished difference Result 4250 states and 4825 transitions. [2021-08-26 09:13:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2021-08-26 09:13:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:49,338 INFO L225 Difference]: With dead ends: 4250 [2021-08-26 09:13:49,338 INFO L226 Difference]: Without dead ends: 2462 [2021-08-26 09:13:49,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2021-08-26 09:13:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2021-08-26 09:13:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2461 states have (on average 1.1174319382364892) internal successors, (2750), 2461 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states 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:13:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2750 transitions. [2021-08-26 09:13:49,460 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2750 transitions. Word has length 117 [2021-08-26 09:13:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:49,460 INFO L470 AbstractCegarLoop]: Abstraction has 2462 states and 2750 transitions. [2021-08-26 09:13:49,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2750 transitions. [2021-08-26 09:13:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-26 09:13:49,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:49,464 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:13:49,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 09:13:49,464 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2021-08-26 09:13:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:49,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92925366] [2021-08-26 09:13:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:49,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:13:49,478 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 09:13:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:13:49,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 09:13:49,525 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 09:13:49,525 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:13:49,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 09:13:49,533 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:13:49,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:13:49 BoogieIcfgContainer [2021-08-26 09:13:49,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:13:49,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:13:49,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:13:49,621 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:13:49,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:44" (3/4) ... [2021-08-26 09:13:49,623 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 09:13:49,738 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:13:49,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:13:49,740 INFO L168 Benchmark]: Toolchain (without parser) took 6722.01 ms. Allocated memory was 62.9 MB in the beginning and 553.6 MB in the end (delta: 490.7 MB). Free memory was 42.6 MB in the beginning and 369.9 MB in the end (delta: -327.3 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,740 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 62.9 MB. Free memory is still 44.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:13:49,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.54 ms. Allocated memory is still 62.9 MB. Free memory was 42.3 MB in the beginning and 44.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.53 ms. Allocated memory is still 62.9 MB. Free memory was 44.1 MB in the beginning and 41.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,741 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 62.9 MB. Free memory was 41.2 MB in the beginning and 38.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:13:49,741 INFO L168 Benchmark]: RCFGBuilder took 836.67 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 38.8 MB in the beginning and 43.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,742 INFO L168 Benchmark]: TraceAbstraction took 5399.27 ms. Allocated memory was 77.6 MB in the beginning and 553.6 MB in the end (delta: 476.1 MB). Free memory was 43.3 MB in the beginning and 386.7 MB in the end (delta: -343.3 MB). Peak memory consumption was 133.7 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,742 INFO L168 Benchmark]: Witness Printer took 116.92 ms. Allocated memory is still 553.6 MB. Free memory was 385.6 MB in the beginning and 369.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 09:13:49,743 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.20 ms. Allocated memory is still 62.9 MB. Free memory is still 44.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 282.54 ms. Allocated memory is still 62.9 MB. Free memory was 42.3 MB in the beginning and 44.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.53 ms. Allocated memory is still 62.9 MB. Free memory was 44.1 MB in the beginning and 41.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 62.9 MB. Free memory was 41.2 MB in the beginning and 38.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 836.67 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 38.8 MB in the beginning and 43.7 MB in the end (delta: -4.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5399.27 ms. Allocated memory was 77.6 MB in the beginning and 553.6 MB in the end (delta: 476.1 MB). Free memory was 43.3 MB in the beginning and 386.7 MB in the end (delta: -343.3 MB). Peak memory consumption was 133.7 MB. Max. memory is 16.1 GB. * Witness Printer took 116.92 ms. Allocated memory is still 553.6 MB. Free memory was 385.6 MB in the beginning and 369.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L326] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L331] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L336] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L341] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L346] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L164] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L183] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L359] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L364] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L369] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L374] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L55] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5252.6ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 41.6ms, AutomataDifference: 2553.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5256 SDtfs, 4833 SDslu, 4133 SDs, 0 SdLazy, 320 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 436.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 136.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3452occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1491.9ms AutomataMinimizationTime, 18 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.3ms SsaConstructionTime, 192.4ms SatisfiabilityAnalysisTime, 602.4ms InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 09:13:49,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...