./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix030_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix030_rmo.opt.i -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 479d998d0c352be1f7b9499ddf280278baa71cf0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 22:13:35,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:13:35,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:13:35,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:13:35,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:13:35,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:13:35,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:13:35,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:13:35,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:13:35,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:13:35,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:13:35,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:13:35,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:13:35,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:13:35,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:13:35,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:13:35,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:13:35,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:13:35,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:13:35,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:13:35,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:13:35,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:13:35,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:13:35,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:13:35,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:13:35,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:13:35,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:13:35,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:13:35,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:13:35,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:13:35,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:13:35,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:13:35,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:13:35,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:13:35,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:13:35,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:13:35,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:13:35,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:13:35,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:13:35,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:13:35,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:13:35,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 22:13:35,813 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:13:35,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:13:35,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:13:35,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:13:35,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:13:35,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:13:35,818 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:13:35,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:13:35,818 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:13:35,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:13:35,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:13:35,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:13:35,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:13:35,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:13:35,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:13:35,820 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:13:35,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:13:35,828 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:13:35,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:13:35,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:13:35,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:13:35,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:13:35,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:35,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:13:35,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:13:35,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:13:35,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:13:35,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:13:35,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:13:35,830 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:13:35,830 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 -> 479d998d0c352be1f7b9499ddf280278baa71cf0 [2021-08-29 22:13:36,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:13:36,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:13:36,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:13:36,134 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:13:36,135 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:13:36,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_rmo.opt.i [2021-08-29 22:13:36,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d53798/e57943568ca34592bea010a80bde033f/FLAGebecec30d [2021-08-29 22:13:36,599 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:13:36,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_rmo.opt.i [2021-08-29 22:13:36,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d53798/e57943568ca34592bea010a80bde033f/FLAGebecec30d [2021-08-29 22:13:36,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d53798/e57943568ca34592bea010a80bde033f [2021-08-29 22:13:36,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:13:36,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:13:36,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:36,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:13:36,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:13:36,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:36" (1/1) ... [2021-08-29 22:13:36,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243e5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:36, skipping insertion in model container [2021-08-29 22:13:36,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:36" (1/1) ... [2021-08-29 22:13:36,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:13:37,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:13:37,102 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/pthread-wmm/mix030_rmo.opt.i[948,961] [2021-08-29 22:13:37,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:37,238 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:13:37,245 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/pthread-wmm/mix030_rmo.opt.i[948,961] [2021-08-29 22:13:37,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:37,298 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:13:37,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37 WrapperNode [2021-08-29 22:13:37,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:37,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:37,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:13:37,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:13:37,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:37,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:13:37,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:13:37,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:13:37,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:13:37,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:13:37,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:13:37,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:13:37,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (1/1) ... [2021-08-29 22:13:37,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:37,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:13:37,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 22:13:37,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 22:13:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:13:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:13:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:13:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:13:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:13:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:13:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:13:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:13:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:13:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:13:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-29 22:13:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-29 22:13:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:13:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:13:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:13:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:13:37,463 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 22:13:38,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:13:38,039 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:13:38,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:38 BoogieIcfgContainer [2021-08-29 22:13:38,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:13:38,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:13:38,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:13:38,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:13:38,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:13:36" (1/3) ... [2021-08-29 22:13:38,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23205a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:38, skipping insertion in model container [2021-08-29 22:13:38,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:37" (2/3) ... [2021-08-29 22:13:38,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23205a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:38, skipping insertion in model container [2021-08-29 22:13:38,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:38" (3/3) ... [2021-08-29 22:13:38,047 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i [2021-08-29 22:13:38,050 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:13:38,051 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:13:38,051 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:13:38,051 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:13:38,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,126 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,126 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,129 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,129 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:38,131 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:13:38,163 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:13:38,168 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 22:13:38,168 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-29 22:13:38,177 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:13:38,185 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:38,186 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:38,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:38,223 INFO L129 PetriNetUnfolder]: 2/123 cut-off events. [2021-08-29 22:13:38,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:13:38,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-08-29 22:13:38,229 INFO L116 LiptonReduction]: Number of co-enabled transitions 2928 [2021-08-29 22:13:44,607 INFO L131 LiptonReduction]: Checked pairs total: 7994 [2021-08-29 22:13:44,607 INFO L133 LiptonReduction]: Total number of compositions: 105 [2021-08-29 22:13:44,615 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2021-08-29 22:13:44,742 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-29 22:13:44,757 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:44,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:44,758 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1763146594, now seen corresponding path program 1 times [2021-08-29 22:13:44,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:44,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095036344] [2021-08-29 22:13:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:44,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:44,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:44,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095036344] [2021-08-29 22:13:44,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095036344] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:44,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:44,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:13:44,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863904528] [2021-08-29 22:13:44,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:44,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:44,990 INFO L87 Difference]: Start difference. First operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:45,101 INFO L93 Difference]: Finished difference Result 3370 states and 13144 transitions. [2021-08-29 22:13:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-08-29 22:13:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:45,135 INFO L225 Difference]: With dead ends: 3370 [2021-08-29 22:13:45,136 INFO L226 Difference]: Without dead ends: 3250 [2021-08-29 22:13:45,136 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:45,141 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.09ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.32ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:45,142 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 1.09ms Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 47.32ms Time] [2021-08-29 22:13:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-08-29 22:13:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2021-08-29 22:13:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2021-08-29 22:13:45,385 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2021-08-29 22:13:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:45,386 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2021-08-29 22:13:45,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2021-08-29 22:13:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:13:45,395 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:45,395 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:45,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:13:45,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash -364657913, now seen corresponding path program 1 times [2021-08-29 22:13:45,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:45,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392370523] [2021-08-29 22:13:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:45,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:45,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:45,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392370523] [2021-08-29 22:13:45,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392370523] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:45,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:45,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:45,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179175016] [2021-08-29 22:13:45,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:45,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:45,566 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:45,722 INFO L93 Difference]: Finished difference Result 3450 states and 13108 transitions. [2021-08-29 22:13:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-29 22:13:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:45,740 INFO L225 Difference]: With dead ends: 3450 [2021-08-29 22:13:45,742 INFO L226 Difference]: Without dead ends: 2850 [2021-08-29 22:13:45,742 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.45ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:45,744 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.18ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:45,744 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 55 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 82.18ms Time] [2021-08-29 22:13:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2021-08-29 22:13:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2850. [2021-08-29 22:13:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2849 states have (on average 3.86030186030186) internal successors, (10998), 2849 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10998 transitions. [2021-08-29 22:13:45,852 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10998 transitions. Word has length 12 [2021-08-29 22:13:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:45,852 INFO L470 AbstractCegarLoop]: Abstraction has 2850 states and 10998 transitions. [2021-08-29 22:13:45,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10998 transitions. [2021-08-29 22:13:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:13:45,854 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:45,854 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:45,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:13:45,855 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1751420375, now seen corresponding path program 1 times [2021-08-29 22:13:45,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:45,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566015818] [2021-08-29 22:13:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:45,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:45,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:45,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566015818] [2021-08-29 22:13:45,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566015818] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:45,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:45,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:45,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981667407] [2021-08-29 22:13:45,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:45,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:45,918 INFO L87 Difference]: Start difference. First operand 2850 states and 10998 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:46,031 INFO L93 Difference]: Finished difference Result 3170 states and 11914 transitions. [2021-08-29 22:13:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 22:13:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:46,061 INFO L225 Difference]: With dead ends: 3170 [2021-08-29 22:13:46,085 INFO L226 Difference]: Without dead ends: 2770 [2021-08-29 22:13:46,085 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:46,087 INFO L928 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.87ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:46,088 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 46.87ms Time] [2021-08-29 22:13:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-08-29 22:13:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2021-08-29 22:13:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.84037558685446) internal successors, (10634), 2769 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10634 transitions. [2021-08-29 22:13:46,199 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10634 transitions. Word has length 14 [2021-08-29 22:13:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,199 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 10634 transitions. [2021-08-29 22:13:46,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10634 transitions. [2021-08-29 22:13:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:13:46,202 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,202 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:13:46,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash 571200329, now seen corresponding path program 1 times [2021-08-29 22:13:46,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623888936] [2021-08-29 22:13:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:46,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-29 22:13:46,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:46,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623888936] [2021-08-29 22:13:46,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623888936] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:46,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:46,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:46,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455168181] [2021-08-29 22:13:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:46,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:46,303 INFO L87 Difference]: Start difference. First operand 2770 states and 10634 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:46,435 INFO L93 Difference]: Finished difference Result 3154 states and 11820 transitions. [2021-08-29 22:13:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-29 22:13:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:46,451 INFO L225 Difference]: With dead ends: 3154 [2021-08-29 22:13:46,451 INFO L226 Difference]: Without dead ends: 2770 [2021-08-29 22:13:46,454 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.92ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:46,457 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.22ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.06ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:46,458 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 59 Invalid, 85 Unknown, 0 Unchecked, 3.22ms Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 83.06ms Time] [2021-08-29 22:13:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-08-29 22:13:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2021-08-29 22:13:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.8187071144817626) internal successors, (10574), 2769 states have internal predecessors, (10574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10574 transitions. [2021-08-29 22:13:46,538 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10574 transitions. Word has length 15 [2021-08-29 22:13:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,538 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 10574 transitions. [2021-08-29 22:13:46,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10574 transitions. [2021-08-29 22:13:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:13:46,542 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,542 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:13:46,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1986096926, now seen corresponding path program 1 times [2021-08-29 22:13:46,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135390717] [2021-08-29 22:13:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:46,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:46,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135390717] [2021-08-29 22:13:46,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135390717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:46,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:46,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:46,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78369190] [2021-08-29 22:13:46,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:46,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:46,687 INFO L87 Difference]: Start difference. First operand 2770 states and 10574 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:46,859 INFO L93 Difference]: Finished difference Result 3026 states and 11346 transitions. [2021-08-29 22:13:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:46,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-08-29 22:13:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:46,874 INFO L225 Difference]: With dead ends: 3026 [2021-08-29 22:13:46,874 INFO L226 Difference]: Without dead ends: 2778 [2021-08-29 22:13:46,874 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.04ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:46,875 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 136.75ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:46,875 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 92 Invalid, 130 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 136.75ms Time] [2021-08-29 22:13:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2021-08-29 22:13:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2021-08-29 22:13:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2777 states have (on average 3.814187972632337) internal successors, (10592), 2777 states have internal predecessors, (10592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 10592 transitions. [2021-08-29 22:13:46,956 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 10592 transitions. Word has length 16 [2021-08-29 22:13:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,956 INFO L470 AbstractCegarLoop]: Abstraction has 2778 states and 10592 transitions. [2021-08-29 22:13:46,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 10592 transitions. [2021-08-29 22:13:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:46,961 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,961 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:13:46,962 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1101267114, now seen corresponding path program 1 times [2021-08-29 22:13:46,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794046429] [2021-08-29 22:13:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794046429] [2021-08-29 22:13:47,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794046429] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:47,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855998373] [2021-08-29 22:13:47,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:47,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:47,136 INFO L87 Difference]: Start difference. First operand 2778 states and 10592 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,394 INFO L93 Difference]: Finished difference Result 3538 states and 13366 transitions. [2021-08-29 22:13:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 22:13:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,407 INFO L225 Difference]: With dead ends: 3538 [2021-08-29 22:13:47,407 INFO L226 Difference]: Without dead ends: 3194 [2021-08-29 22:13:47,408 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 89.81ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:13:47,408 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 101 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 147.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.40ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.83ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,408 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 107 Invalid, 177 Unknown, 0 Unchecked, 1.40ms Time], IncrementalHoareTripleChecker [34 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 170.83ms Time] [2021-08-29 22:13:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-08-29 22:13:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3010. [2021-08-29 22:13:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3009 states have (on average 3.786640079760718) internal successors, (11394), 3009 states have internal predecessors, (11394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 11394 transitions. [2021-08-29 22:13:47,485 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 11394 transitions. Word has length 17 [2021-08-29 22:13:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,485 INFO L470 AbstractCegarLoop]: Abstraction has 3010 states and 11394 transitions. [2021-08-29 22:13:47,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 11394 transitions. [2021-08-29 22:13:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:47,491 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,491 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:13:47,491 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1673294520, now seen corresponding path program 1 times [2021-08-29 22:13:47,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680521835] [2021-08-29 22:13:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680521835] [2021-08-29 22:13:47,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680521835] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:13:47,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591244439] [2021-08-29 22:13:47,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:13:47,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:13:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:47,685 INFO L87 Difference]: Start difference. First operand 3010 states and 11394 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,883 INFO L93 Difference]: Finished difference Result 3850 states and 14460 transitions. [2021-08-29 22:13:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:47,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,896 INFO L225 Difference]: With dead ends: 3850 [2021-08-29 22:13:47,896 INFO L226 Difference]: Without dead ends: 3722 [2021-08-29 22:13:47,897 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 38.46ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:47,897 INFO L928 BasicCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 138.93ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,898 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 151 Invalid, 200 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 138.93ms Time] [2021-08-29 22:13:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2021-08-29 22:13:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3082. [2021-08-29 22:13:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3081 states have (on average 3.7844855566374553) internal successors, (11660), 3081 states have internal predecessors, (11660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 11660 transitions. [2021-08-29 22:13:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 11660 transitions. Word has length 18 [2021-08-29 22:13:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,974 INFO L470 AbstractCegarLoop]: Abstraction has 3082 states and 11660 transitions. [2021-08-29 22:13:47,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 11660 transitions. [2021-08-29 22:13:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:47,980 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,980 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:13:47,980 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1936143124, now seen corresponding path program 2 times [2021-08-29 22:13:47,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889089948] [2021-08-29 22:13:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:48,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:48,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889089948] [2021-08-29 22:13:48,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889089948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:48,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:48,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:13:48,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247811004] [2021-08-29 22:13:48,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:13:48,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:13:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:48,148 INFO L87 Difference]: Start difference. First operand 3082 states and 11660 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:48,350 INFO L93 Difference]: Finished difference Result 3826 states and 14190 transitions. [2021-08-29 22:13:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:13:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:48,363 INFO L225 Difference]: With dead ends: 3826 [2021-08-29 22:13:48,363 INFO L226 Difference]: Without dead ends: 3666 [2021-08-29 22:13:48,364 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.68ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:13:48,364 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 122 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.70ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 137.86ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:48,364 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 122 Invalid, 184 Unknown, 0 Unchecked, 1.70ms Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 137.86ms Time] [2021-08-29 22:13:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2021-08-29 22:13:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 2722. [2021-08-29 22:13:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.772877618522602) internal successors, (10266), 2721 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10266 transitions. [2021-08-29 22:13:48,442 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10266 transitions. Word has length 18 [2021-08-29 22:13:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:48,443 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 10266 transitions. [2021-08-29 22:13:48,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10266 transitions. [2021-08-29 22:13:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:48,448 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:48,448 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:48,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:13:48,448 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash -63096264, now seen corresponding path program 1 times [2021-08-29 22:13:48,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:48,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790396699] [2021-08-29 22:13:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:48,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:48,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:48,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790396699] [2021-08-29 22:13:48,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790396699] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:48,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:48,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:48,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191273939] [2021-08-29 22:13:48,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:48,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:48,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:48,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:48,624 INFO L87 Difference]: Start difference. First operand 2722 states and 10266 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:48,761 INFO L93 Difference]: Finished difference Result 2978 states and 11174 transitions. [2021-08-29 22:13:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:13:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:48,769 INFO L225 Difference]: With dead ends: 2978 [2021-08-29 22:13:48,770 INFO L226 Difference]: Without dead ends: 2834 [2021-08-29 22:13:48,770 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 57.37ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:13:48,770 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.82ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:48,771 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 92 Invalid, 122 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 97.82ms Time] [2021-08-29 22:13:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-08-29 22:13:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2722. [2021-08-29 22:13:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.768467475192944) internal successors, (10254), 2721 states have internal predecessors, (10254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10254 transitions. [2021-08-29 22:13:48,826 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10254 transitions. Word has length 18 [2021-08-29 22:13:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:48,827 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 10254 transitions. [2021-08-29 22:13:48,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10254 transitions. [2021-08-29 22:13:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:48,831 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:48,832 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:48,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:13:48,832 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -42786490, now seen corresponding path program 1 times [2021-08-29 22:13:48,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:48,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745374529] [2021-08-29 22:13:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:48,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:48,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:48,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745374529] [2021-08-29 22:13:48,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745374529] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:48,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:48,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:48,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099778941] [2021-08-29 22:13:48,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:48,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:48,868 INFO L87 Difference]: Start difference. First operand 2722 states and 10254 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:48,946 INFO L93 Difference]: Finished difference Result 3958 states and 14741 transitions. [2021-08-29 22:13:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:48,954 INFO L225 Difference]: With dead ends: 3958 [2021-08-29 22:13:48,954 INFO L226 Difference]: Without dead ends: 2506 [2021-08-29 22:13:48,954 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.67ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:48,955 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.37ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.46ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:48,955 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 68 Unknown, 0 Unchecked, 0.37ms Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 53.46ms Time] [2021-08-29 22:13:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2021-08-29 22:13:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2362. [2021-08-29 22:13:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 3.6137229987293518) internal successors, (8532), 2361 states have internal predecessors, (8532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8532 transitions. [2021-08-29 22:13:49,007 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8532 transitions. Word has length 18 [2021-08-29 22:13:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,007 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 8532 transitions. [2021-08-29 22:13:49,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8532 transitions. [2021-08-29 22:13:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:49,011 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,011 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:13:49,012 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -94503770, now seen corresponding path program 2 times [2021-08-29 22:13:49,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666479893] [2021-08-29 22:13:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666479893] [2021-08-29 22:13:49,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666479893] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:49,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075475635] [2021-08-29 22:13:49,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:49,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:49,047 INFO L87 Difference]: Start difference. First operand 2362 states and 8532 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,083 INFO L93 Difference]: Finished difference Result 1810 states and 5898 transitions. [2021-08-29 22:13:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,088 INFO L225 Difference]: With dead ends: 1810 [2021-08-29 22:13:49,088 INFO L226 Difference]: Without dead ends: 1810 [2021-08-29 22:13:49,088 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.30ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:49,089 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.10ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,089 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 34 Unknown, 0 Unchecked, 0.16ms Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 28.10ms Time] [2021-08-29 22:13:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2021-08-29 22:13:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2021-08-29 22:13:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 3.2603648424543947) internal successors, (5898), 1809 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 5898 transitions. [2021-08-29 22:13:49,139 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 5898 transitions. Word has length 18 [2021-08-29 22:13:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,140 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 5898 transitions. [2021-08-29 22:13:49,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 5898 transitions. [2021-08-29 22:13:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-29 22:13:49,143 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,143 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:13:49,144 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1647054081, now seen corresponding path program 1 times [2021-08-29 22:13:49,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859053505] [2021-08-29 22:13:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859053505] [2021-08-29 22:13:49,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859053505] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:49,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279680696] [2021-08-29 22:13:49,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:49,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:49,181 INFO L87 Difference]: Start difference. First operand 1810 states and 5898 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,231 INFO L93 Difference]: Finished difference Result 1170 states and 3440 transitions. [2021-08-29 22:13:49,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:49,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-29 22:13:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,234 INFO L225 Difference]: With dead ends: 1170 [2021-08-29 22:13:49,234 INFO L226 Difference]: Without dead ends: 1170 [2021-08-29 22:13:49,235 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.06ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:49,235 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.26ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.48ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,235 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 26 Invalid, 52 Unknown, 0 Unchecked, 0.26ms Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 44.48ms Time] [2021-08-29 22:13:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2021-08-29 22:13:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2021-08-29 22:13:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 2.9426860564585113) internal successors, (3440), 1169 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 3440 transitions. [2021-08-29 22:13:49,252 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 3440 transitions. Word has length 19 [2021-08-29 22:13:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,253 INFO L470 AbstractCegarLoop]: Abstraction has 1170 states and 3440 transitions. [2021-08-29 22:13:49,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 3440 transitions. [2021-08-29 22:13:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 22:13:49,255 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,255 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:13:49,255 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1736390888, now seen corresponding path program 1 times [2021-08-29 22:13:49,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95930158] [2021-08-29 22:13:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95930158] [2021-08-29 22:13:49,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95930158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:49,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109822535] [2021-08-29 22:13:49,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:49,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:49,288 INFO L87 Difference]: Start difference. First operand 1170 states and 3440 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,363 INFO L93 Difference]: Finished difference Result 1735 states and 4912 transitions. [2021-08-29 22:13:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-29 22:13:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,366 INFO L225 Difference]: With dead ends: 1735 [2021-08-29 22:13:49,366 INFO L226 Difference]: Without dead ends: 1198 [2021-08-29 22:13:49,367 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:49,367 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.77ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,367 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 81 Unknown, 0 Unchecked, 0.41ms Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 62.77ms Time] [2021-08-29 22:13:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2021-08-29 22:13:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1150. [2021-08-29 22:13:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 2.783289817232376) internal successors, (3198), 1149 states have internal predecessors, (3198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 3198 transitions. [2021-08-29 22:13:49,385 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 3198 transitions. Word has length 21 [2021-08-29 22:13:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,385 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 3198 transitions. [2021-08-29 22:13:49,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 3198 transitions. [2021-08-29 22:13:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 22:13:49,387 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,387 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:13:49,388 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1335495724, now seen corresponding path program 1 times [2021-08-29 22:13:49,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759875629] [2021-08-29 22:13:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759875629] [2021-08-29 22:13:49,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759875629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:49,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290620494] [2021-08-29 22:13:49,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:49,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:49,428 INFO L87 Difference]: Start difference. First operand 1150 states and 3198 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,493 INFO L93 Difference]: Finished difference Result 876 states and 2424 transitions. [2021-08-29 22:13:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-29 22:13:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,495 INFO L225 Difference]: With dead ends: 876 [2021-08-29 22:13:49,495 INFO L226 Difference]: Without dead ends: 812 [2021-08-29 22:13:49,495 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.30ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:49,495 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.44ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,496 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 34 Invalid, 73 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 59.44ms Time] [2021-08-29 22:13:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-08-29 22:13:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 804. [2021-08-29 22:13:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 2.7646326276463262) internal successors, (2220), 803 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2220 transitions. [2021-08-29 22:13:49,507 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2220 transitions. Word has length 22 [2021-08-29 22:13:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,507 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 2220 transitions. [2021-08-29 22:13:49,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2220 transitions. [2021-08-29 22:13:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:49,509 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,509 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:13:49,510 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223676, now seen corresponding path program 1 times [2021-08-29 22:13:49,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244382604] [2021-08-29 22:13:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244382604] [2021-08-29 22:13:49,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244382604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:13:49,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708561375] [2021-08-29 22:13:49,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:13:49,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:13:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:13:49,601 INFO L87 Difference]: Start difference. First operand 804 states and 2220 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,848 INFO L93 Difference]: Finished difference Result 1076 states and 2864 transitions. [2021-08-29 22:13:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-29 22:13:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,850 INFO L225 Difference]: With dead ends: 1076 [2021-08-29 22:13:49,850 INFO L226 Difference]: Without dead ends: 893 [2021-08-29 22:13:49,851 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 78.07ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-29 22:13:49,851 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 63 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 188.92ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,851 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 328 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [14 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 188.92ms Time] [2021-08-29 22:13:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-08-29 22:13:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 887. [2021-08-29 22:13:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 2.7313769751693004) internal successors, (2420), 886 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2420 transitions. [2021-08-29 22:13:49,863 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2420 transitions. Word has length 25 [2021-08-29 22:13:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:49,864 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 2420 transitions. [2021-08-29 22:13:49,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2420 transitions. [2021-08-29 22:13:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:49,866 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:49,866 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:49,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:13:49,866 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1635143422, now seen corresponding path program 1 times [2021-08-29 22:13:49,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:49,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116093609] [2021-08-29 22:13:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:49,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:49,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:49,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116093609] [2021-08-29 22:13:49,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116093609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:49,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:49,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:49,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361265764] [2021-08-29 22:13:49,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:49,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:49,916 INFO L87 Difference]: Start difference. First operand 887 states and 2420 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:49,994 INFO L93 Difference]: Finished difference Result 833 states and 2316 transitions. [2021-08-29 22:13:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:49,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:49,996 INFO L225 Difference]: With dead ends: 833 [2021-08-29 22:13:49,997 INFO L226 Difference]: Without dead ends: 446 [2021-08-29 22:13:49,997 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.01ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:49,997 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 88 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.54ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.22ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:49,998 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 32 Invalid, 80 Unknown, 0 Unchecked, 0.54ms Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 72.22ms Time] [2021-08-29 22:13:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-08-29 22:13:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2021-08-29 22:13:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.7595505617977527) internal successors, (1228), 445 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1228 transitions. [2021-08-29 22:13:50,005 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1228 transitions. Word has length 25 [2021-08-29 22:13:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:50,006 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1228 transitions. [2021-08-29 22:13:50,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1228 transitions. [2021-08-29 22:13:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 22:13:50,007 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:50,007 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:50,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:13:50,008 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -604125990, now seen corresponding path program 1 times [2021-08-29 22:13:50,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:50,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060332758] [2021-08-29 22:13:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:50,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:50,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:50,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060332758] [2021-08-29 22:13:50,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060332758] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:50,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:50,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:50,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281974715] [2021-08-29 22:13:50,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:50,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:50,053 INFO L87 Difference]: Start difference. First operand 446 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:50,115 INFO L93 Difference]: Finished difference Result 548 states and 1489 transitions. [2021-08-29 22:13:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-29 22:13:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:50,116 INFO L225 Difference]: With dead ends: 548 [2021-08-29 22:13:50,116 INFO L226 Difference]: Without dead ends: 139 [2021-08-29 22:13:50,116 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.46ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:50,117 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.47ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.64ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:50,117 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 85 Unknown, 0 Unchecked, 0.47ms Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 49.64ms Time] [2021-08-29 22:13:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-29 22:13:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-08-29 22:13:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.347826086956522) internal successors, (324), 138 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 324 transitions. [2021-08-29 22:13:50,120 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 324 transitions. Word has length 28 [2021-08-29 22:13:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:50,121 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 324 transitions. [2021-08-29 22:13:50,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 324 transitions. [2021-08-29 22:13:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 22:13:50,121 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:50,122 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:50,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 22:13:50,122 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 348630712, now seen corresponding path program 2 times [2021-08-29 22:13:50,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:50,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327791751] [2021-08-29 22:13:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:50,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:50,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:50,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327791751] [2021-08-29 22:13:50,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327791751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:50,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:50,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 22:13:50,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196450656] [2021-08-29 22:13:50,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 22:13:50,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 22:13:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:13:50,421 INFO L87 Difference]: Start difference. First operand 139 states and 324 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:50,573 INFO L93 Difference]: Finished difference Result 178 states and 411 transitions. [2021-08-29 22:13:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-29 22:13:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:50,574 INFO L225 Difference]: With dead ends: 178 [2021-08-29 22:13:50,574 INFO L226 Difference]: Without dead ends: 93 [2021-08-29 22:13:50,574 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 114.46ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-29 22:13:50,574 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.52ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:50,575 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 130 Invalid, 162 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 119.52ms Time] [2021-08-29 22:13:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-29 22:13:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-29 22:13:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.130434782608696) internal successors, (196), 92 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 196 transitions. [2021-08-29 22:13:50,577 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 196 transitions. Word has length 28 [2021-08-29 22:13:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:50,577 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 196 transitions. [2021-08-29 22:13:50,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 196 transitions. [2021-08-29 22:13:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 22:13:50,578 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:50,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:50,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 22:13:50,578 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash 216556974, now seen corresponding path program 3 times [2021-08-29 22:13:50,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:50,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447052891] [2021-08-29 22:13:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:50,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:50,610 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:13:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:50,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:13:50,661 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:13:50,661 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-08-29 22:13:50,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-08-29 22:13:50,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-08-29 22:13:50,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-08-29 22:13:50,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-08-29 22:13:50,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-08-29 22:13:50,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-08-29 22:13:50,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 22:13:50,669 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:13:50,669 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:13:50,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:13:50 BasicIcfg [2021-08-29 22:13:50,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:13:50,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:13:50,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:13:50,734 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:13:50,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:38" (3/4) ... [2021-08-29 22:13:50,736 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:13:50,812 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:13:50,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:13:50,812 INFO L158 Benchmark]: Toolchain (without parser) took 13850.76ms. Allocated memory was 52.4MB in the beginning and 901.8MB in the end (delta: 849.3MB). Free memory was 27.7MB in the beginning and 603.3MB in the end (delta: -575.6MB). Peak memory consumption was 271.7MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,813 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:13:50,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.71ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 27.5MB in the beginning and 36.7MB in the end (delta: -9.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.72ms. Allocated memory is still 67.1MB. Free memory was 36.7MB in the beginning and 45.7MB in the end (delta: -9.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,813 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 43.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,814 INFO L158 Benchmark]: RCFGBuilder took 647.08ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.4MB in the beginning and 41.2MB in the end (delta: 2.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,814 INFO L158 Benchmark]: TraceAbstraction took 12690.77ms. Allocated memory was 81.8MB in the beginning and 901.8MB in the end (delta: 820.0MB). Free memory was 40.8MB in the beginning and 623.3MB in the end (delta: -582.4MB). Peak memory consumption was 238.4MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,814 INFO L158 Benchmark]: Witness Printer took 78.23ms. Allocated memory is still 901.8MB. Free memory was 623.3MB in the beginning and 603.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-08-29 22:13:50,815 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.16ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.71ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 27.5MB in the beginning and 36.7MB in the end (delta: -9.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.72ms. Allocated memory is still 67.1MB. Free memory was 36.7MB in the beginning and 45.7MB in the end (delta: -9.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 43.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.08ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.4MB in the beginning and 41.2MB in the end (delta: 2.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12690.77ms. Allocated memory was 81.8MB in the beginning and 901.8MB in the end (delta: 820.0MB). Free memory was 40.8MB in the beginning and 623.3MB in the end (delta: -582.4MB). Peak memory consumption was 238.4MB. Max. memory is 16.1GB. * Witness Printer took 78.23ms. Allocated memory is still 901.8MB. Free memory was 623.3MB in the beginning and 603.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6420.99ms, 138 PlacesBefore, 47 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 2928 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 7994 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3556, positive: 3343, positive conditional: 0, positive unconditional: 3343, negative: 213, negative conditional: 0, negative unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1962, positive: 1911, positive conditional: 0, positive unconditional: 1911, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1962, positive: 1875, positive conditional: 0, positive unconditional: 1875, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 460, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 397, negative conditional: 0, negative unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3556, positive: 1432, positive conditional: 0, positive unconditional: 1432, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t821; [L845] FCALL, FORK 0 pthread_create(&t821, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t822; [L847] FCALL, FORK 0 pthread_create(&t822, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t823; [L849] FCALL, FORK 0 pthread_create(&t823, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t824; [L851] FCALL, FORK 0 pthread_create(&t824, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 12504.74ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 69.68ms, AutomataDifference: 2620.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6574.39ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 1620.17ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 924 mSDsluCounter, 1426 SdHoareTripleChecker+Invalid, 1351.58ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1817 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1831 IncrementalHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 396 mSDtfsCounter, 1831 mSolverCounterSat, 18.54ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 583.87ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4130occurred in iteration=0, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1060.43ms AutomataMinimizationTime, 18 MinimizatonAttempts, 2086 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.56ms SsaConstructionTime, 388.46ms SatisfiabilityAnalysisTime, 1465.76ms InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 3135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 22:13:50,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...