./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/mix057_tso.oepc.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 6df937937075082959735d2992fd1cc04193c7fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-9a8b2e8 [2020-10-20 03:00:00,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:00:00,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:00:00,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:00:00,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:00:00,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:00:00,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:00:00,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:00:00,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:00:00,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:00:00,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:00:00,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:00:00,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:00:00,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:00:00,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:00:00,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:00:00,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:00:00,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:00:00,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:00:00,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:00:00,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:00:00,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:00:00,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:00:00,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:00:00,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:00:00,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:00:00,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:00:00,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:00:00,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:00:00,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:00:00,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:00:00,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:00:00,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:00:00,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:00:00,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:00:00,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:00:00,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:00:00,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:00:00,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:00:01,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:00:01,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:00:01,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:00:01,024 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:00:01,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:00:01,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:00:01,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:00:01,026 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:00:01,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:00:01,026 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:00:01,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:00:01,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:00:01,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:00:01,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:00:01,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:00:01,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:00:01,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:00:01,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:00:01,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:00:01,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:00:01,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:00:01,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:00:01,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:00:01,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:00:01,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:00:01,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:00:01,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:00:01,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 6df937937075082959735d2992fd1cc04193c7fa [2020-10-20 03:00:01,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:00:01,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:00:01,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:00:01,277 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:00:01,278 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:00:01,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2020-10-20 03:00:01,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7168c54/e26a8ee43fa449fc8a4d4ebdb799c68d/FLAG85077b4a4 [2020-10-20 03:00:01,880 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:00:01,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2020-10-20 03:00:01,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7168c54/e26a8ee43fa449fc8a4d4ebdb799c68d/FLAG85077b4a4 [2020-10-20 03:00:02,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7168c54/e26a8ee43fa449fc8a4d4ebdb799c68d [2020-10-20 03:00:02,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:00:02,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:00:02,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:00:02,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:00:02,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:00:02,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6bd522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02, skipping insertion in model container [2020-10-20 03:00:02,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:00:02,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:00:02,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:00:02,732 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:00:02,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:00:02,875 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:00:02,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02 WrapperNode [2020-10-20 03:00:02,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:00:02,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:00:02,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:00:02,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:00:02,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:00:02,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:00:02,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:00:02,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:00:02,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:02,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... [2020-10-20 03:00:03,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:00:03,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:00:03,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:00:03,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:00:03,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:00:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:00:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:00:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:00:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:00:03,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:00:03,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:00:03,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:00:03,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:00:03,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:00:03,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:00:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-20 03:00:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-20 03:00:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:00:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:00:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:00:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:00:03,082 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:00:05,189 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:00:05,189 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:00:05,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:05 BoogieIcfgContainer [2020-10-20 03:00:05,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:00:05,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:00:05,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:00:05,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:00:05,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:00:02" (1/3) ... [2020-10-20 03:00:05,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d01f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:00:05, skipping insertion in model container [2020-10-20 03:00:05,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:00:02" (2/3) ... [2020-10-20 03:00:05,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d01f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:00:05, skipping insertion in model container [2020-10-20 03:00:05,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:05" (3/3) ... [2020-10-20 03:00:05,201 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-10-20 03:00:05,213 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:00:05,214 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:00:05,222 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:00:05,223 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:00:05,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,272 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,273 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,273 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,276 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,276 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,278 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,280 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,286 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,286 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,287 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,287 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,288 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,288 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,299 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,299 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:00:05,301 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:00:05,316 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 03:00:05,347 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:00:05,347 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:00:05,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:00:05,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:00:05,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:00:05,348 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:00:05,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:00:05,348 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:00:05,366 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:00:05,369 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-20 03:00:05,372 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-20 03:00:05,375 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-20 03:00:05,436 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-20 03:00:05,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:00:05,444 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-20 03:00:05,449 INFO L117 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-20 03:00:05,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:00:05,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:05,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:00:05,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:05,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:05,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:05,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:05,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:05,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:05,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:05,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:05,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:06,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:00:06,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:06,573 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 03:00:06,833 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-10-20 03:00:07,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:00:07,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:00:07,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:00:07,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:00:07,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:00:07,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:00:07,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:07,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:07,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:09,140 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-20 03:00:09,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-20 03:00:09,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:09,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-20 03:00:09,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:00:10,395 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-20 03:00:10,924 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-20 03:00:11,352 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-20 03:00:11,786 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-20 03:00:11,969 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-20 03:00:11,987 INFO L132 LiptonReduction]: Checked pairs total: 6442 [2020-10-20 03:00:11,987 INFO L134 LiptonReduction]: Total number of compositions: 98 [2020-10-20 03:00:11,997 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-20 03:00:12,216 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-10-20 03:00:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-10-20 03:00:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:00:12,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:12,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:12,233 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1604801105, now seen corresponding path program 1 times [2020-10-20 03:00:12,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:12,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210424023] [2020-10-20 03:00:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:12,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210424023] [2020-10-20 03:00:12,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:12,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:00:12,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725680571] [2020-10-20 03:00:12,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:00:12,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:00:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:00:12,573 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-10-20 03:00:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:12,701 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-20 03:00:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:00:12,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 03:00:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:12,760 INFO L225 Difference]: With dead ends: 2602 [2020-10-20 03:00:12,761 INFO L226 Difference]: Without dead ends: 2202 [2020-10-20 03:00:12,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:00:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-10-20 03:00:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-10-20 03:00:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-20 03:00:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-10-20 03:00:13,210 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-10-20 03:00:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:13,211 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-10-20 03:00:13,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:00:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-10-20 03:00:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:00:13,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:13,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:13,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:00:13,219 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042416, now seen corresponding path program 1 times [2020-10-20 03:00:13,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:13,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671331547] [2020-10-20 03:00:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:13,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671331547] [2020-10-20 03:00:13,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:13,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:00:13,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31359975] [2020-10-20 03:00:13,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:13,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:13,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:13,416 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-10-20 03:00:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:13,515 INFO L93 Difference]: Finished difference Result 2586 states and 9596 transitions. [2020-10-20 03:00:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:00:13,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 03:00:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:13,535 INFO L225 Difference]: With dead ends: 2586 [2020-10-20 03:00:13,535 INFO L226 Difference]: Without dead ends: 2186 [2020-10-20 03:00:13,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-10-20 03:00:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2020-10-20 03:00:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2020-10-20 03:00:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 8348 transitions. [2020-10-20 03:00:13,686 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 8348 transitions. Word has length 12 [2020-10-20 03:00:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:13,687 INFO L481 AbstractCegarLoop]: Abstraction has 2186 states and 8348 transitions. [2020-10-20 03:00:13,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 8348 transitions. [2020-10-20 03:00:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:00:13,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:13,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:13,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:00:13,690 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1067393042, now seen corresponding path program 1 times [2020-10-20 03:00:13,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:13,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629974558] [2020-10-20 03:00:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:13,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629974558] [2020-10-20 03:00:13,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:13,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:13,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658379557] [2020-10-20 03:00:13,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:13,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:13,801 INFO L87 Difference]: Start difference. First operand 2186 states and 8348 transitions. Second operand 5 states. [2020-10-20 03:00:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:13,914 INFO L93 Difference]: Finished difference Result 2442 states and 9068 transitions. [2020-10-20 03:00:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:13,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 03:00:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:13,935 INFO L225 Difference]: With dead ends: 2442 [2020-10-20 03:00:13,935 INFO L226 Difference]: Without dead ends: 2122 [2020-10-20 03:00:13,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-20 03:00:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-20 03:00:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-20 03:00:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8060 transitions. [2020-10-20 03:00:14,281 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8060 transitions. Word has length 13 [2020-10-20 03:00:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:14,281 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8060 transitions. [2020-10-20 03:00:14,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8060 transitions. [2020-10-20 03:00:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:00:14,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:14,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:14,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:00:14,285 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1067398808, now seen corresponding path program 1 times [2020-10-20 03:00:14,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:14,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354035211] [2020-10-20 03:00:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:14,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354035211] [2020-10-20 03:00:14,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:14,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:00:14,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002830260] [2020-10-20 03:00:14,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:14,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:14,419 INFO L87 Difference]: Start difference. First operand 2122 states and 8060 transitions. Second operand 4 states. [2020-10-20 03:00:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:14,511 INFO L93 Difference]: Finished difference Result 2426 states and 8968 transitions. [2020-10-20 03:00:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:00:14,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 03:00:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:14,531 INFO L225 Difference]: With dead ends: 2426 [2020-10-20 03:00:14,531 INFO L226 Difference]: Without dead ends: 2106 [2020-10-20 03:00:14,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2020-10-20 03:00:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2106. [2020-10-20 03:00:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-20 03:00:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7984 transitions. [2020-10-20 03:00:14,621 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7984 transitions. Word has length 13 [2020-10-20 03:00:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:14,621 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7984 transitions. [2020-10-20 03:00:14,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7984 transitions. [2020-10-20 03:00:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:00:14,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:14,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:14,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:00:14,625 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash 984029452, now seen corresponding path program 1 times [2020-10-20 03:00:14,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:14,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387457703] [2020-10-20 03:00:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:14,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387457703] [2020-10-20 03:00:14,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:14,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:14,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128733377] [2020-10-20 03:00:14,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:14,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:14,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:14,801 INFO L87 Difference]: Start difference. First operand 2106 states and 7984 transitions. Second operand 5 states. [2020-10-20 03:00:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:14,923 INFO L93 Difference]: Finished difference Result 2546 states and 9390 transitions. [2020-10-20 03:00:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:14,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:00:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:14,948 INFO L225 Difference]: With dead ends: 2546 [2020-10-20 03:00:14,948 INFO L226 Difference]: Without dead ends: 2314 [2020-10-20 03:00:14,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2020-10-20 03:00:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2250. [2020-10-20 03:00:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-10-20 03:00:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8460 transitions. [2020-10-20 03:00:15,031 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8460 transitions. Word has length 14 [2020-10-20 03:00:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:15,032 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 8460 transitions. [2020-10-20 03:00:15,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8460 transitions. [2020-10-20 03:00:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:00:15,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:15,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:15,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:00:15,036 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash -570278486, now seen corresponding path program 1 times [2020-10-20 03:00:15,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:15,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462900450] [2020-10-20 03:00:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:15,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462900450] [2020-10-20 03:00:15,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:15,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:15,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779615545] [2020-10-20 03:00:15,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:15,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:15,130 INFO L87 Difference]: Start difference. First operand 2250 states and 8460 transitions. Second operand 5 states. [2020-10-20 03:00:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:15,244 INFO L93 Difference]: Finished difference Result 2502 states and 9184 transitions. [2020-10-20 03:00:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:00:15,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:00:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:15,263 INFO L225 Difference]: With dead ends: 2502 [2020-10-20 03:00:15,263 INFO L226 Difference]: Without dead ends: 2222 [2020-10-20 03:00:15,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2020-10-20 03:00:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2020-10-20 03:00:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2020-10-20 03:00:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 8336 transitions. [2020-10-20 03:00:15,341 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 8336 transitions. Word has length 14 [2020-10-20 03:00:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:15,341 INFO L481 AbstractCegarLoop]: Abstraction has 2222 states and 8336 transitions. [2020-10-20 03:00:15,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 8336 transitions. [2020-10-20 03:00:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:00:15,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:15,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:15,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:00:15,345 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1270513322, now seen corresponding path program 1 times [2020-10-20 03:00:15,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:15,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060467815] [2020-10-20 03:00:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:15,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060467815] [2020-10-20 03:00:15,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:15,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:15,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930123710] [2020-10-20 03:00:15,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:15,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:15,411 INFO L87 Difference]: Start difference. First operand 2222 states and 8336 transitions. Second operand 5 states. [2020-10-20 03:00:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:15,557 INFO L93 Difference]: Finished difference Result 2414 states and 8848 transitions. [2020-10-20 03:00:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:15,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:00:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:15,571 INFO L225 Difference]: With dead ends: 2414 [2020-10-20 03:00:15,571 INFO L226 Difference]: Without dead ends: 2158 [2020-10-20 03:00:15,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2020-10-20 03:00:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2158. [2020-10-20 03:00:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2020-10-20 03:00:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 8048 transitions. [2020-10-20 03:00:15,676 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 8048 transitions. Word has length 14 [2020-10-20 03:00:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:15,676 INFO L481 AbstractCegarLoop]: Abstraction has 2158 states and 8048 transitions. [2020-10-20 03:00:15,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 8048 transitions. [2020-10-20 03:00:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:00:15,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:15,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:15,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:00:15,681 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash 440106962, now seen corresponding path program 1 times [2020-10-20 03:00:15,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:15,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458698116] [2020-10-20 03:00:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:15,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458698116] [2020-10-20 03:00:15,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:15,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:15,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766203631] [2020-10-20 03:00:15,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:15,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:15,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:15,761 INFO L87 Difference]: Start difference. First operand 2158 states and 8048 transitions. Second operand 6 states. [2020-10-20 03:00:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:15,913 INFO L93 Difference]: Finished difference Result 3902 states and 13940 transitions. [2020-10-20 03:00:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:00:15,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 03:00:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:15,924 INFO L225 Difference]: With dead ends: 3902 [2020-10-20 03:00:15,925 INFO L226 Difference]: Without dead ends: 2526 [2020-10-20 03:00:15,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:00:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2020-10-20 03:00:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 1934. [2020-10-20 03:00:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-10-20 03:00:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 6976 transitions. [2020-10-20 03:00:16,039 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 6976 transitions. Word has length 15 [2020-10-20 03:00:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:16,039 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 6976 transitions. [2020-10-20 03:00:16,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 6976 transitions. [2020-10-20 03:00:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:00:16,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:16,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:16,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:00:16,044 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -498625880, now seen corresponding path program 1 times [2020-10-20 03:00:16,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:16,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081438212] [2020-10-20 03:00:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:16,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081438212] [2020-10-20 03:00:16,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:16,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:16,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047881421] [2020-10-20 03:00:16,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:16,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:16,140 INFO L87 Difference]: Start difference. First operand 1934 states and 6976 transitions. Second operand 6 states. [2020-10-20 03:00:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:16,290 INFO L93 Difference]: Finished difference Result 2102 states and 7412 transitions. [2020-10-20 03:00:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:16,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 03:00:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:16,298 INFO L225 Difference]: With dead ends: 2102 [2020-10-20 03:00:16,299 INFO L226 Difference]: Without dead ends: 1878 [2020-10-20 03:00:16,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:00:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-10-20 03:00:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2020-10-20 03:00:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2020-10-20 03:00:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6728 transitions. [2020-10-20 03:00:16,358 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6728 transitions. Word has length 15 [2020-10-20 03:00:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:16,358 INFO L481 AbstractCegarLoop]: Abstraction has 1878 states and 6728 transitions. [2020-10-20 03:00:16,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6728 transitions. [2020-10-20 03:00:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:00:16,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:16,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:16,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:00:16,363 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:16,363 INFO L82 PathProgramCache]: Analyzing trace with hash -498850754, now seen corresponding path program 1 times [2020-10-20 03:00:16,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:16,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011985542] [2020-10-20 03:00:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:16,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011985542] [2020-10-20 03:00:16,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:16,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:16,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757761101] [2020-10-20 03:00:16,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:16,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:16,458 INFO L87 Difference]: Start difference. First operand 1878 states and 6728 transitions. Second operand 5 states. [2020-10-20 03:00:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:16,583 INFO L93 Difference]: Finished difference Result 2060 states and 7226 transitions. [2020-10-20 03:00:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:16,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-20 03:00:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:16,593 INFO L225 Difference]: With dead ends: 2060 [2020-10-20 03:00:16,593 INFO L226 Difference]: Without dead ends: 1850 [2020-10-20 03:00:16,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-10-20 03:00:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2020-10-20 03:00:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-10-20 03:00:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6604 transitions. [2020-10-20 03:00:16,658 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6604 transitions. Word has length 15 [2020-10-20 03:00:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:16,661 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 6604 transitions. [2020-10-20 03:00:16,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6604 transitions. [2020-10-20 03:00:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:00:16,665 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:16,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:16,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:00:16,666 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1722380032, now seen corresponding path program 1 times [2020-10-20 03:00:16,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:16,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610291727] [2020-10-20 03:00:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:16,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610291727] [2020-10-20 03:00:16,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:16,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:16,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476567837] [2020-10-20 03:00:16,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:16,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:16,776 INFO L87 Difference]: Start difference. First operand 1850 states and 6604 transitions. Second operand 6 states. [2020-10-20 03:00:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:16,919 INFO L93 Difference]: Finished difference Result 2142 states and 7492 transitions. [2020-10-20 03:00:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:16,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 03:00:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:16,927 INFO L225 Difference]: With dead ends: 2142 [2020-10-20 03:00:16,928 INFO L226 Difference]: Without dead ends: 1946 [2020-10-20 03:00:16,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:00:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-10-20 03:00:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1890. [2020-10-20 03:00:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2020-10-20 03:00:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6684 transitions. [2020-10-20 03:00:17,020 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6684 transitions. Word has length 16 [2020-10-20 03:00:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:17,021 INFO L481 AbstractCegarLoop]: Abstraction has 1890 states and 6684 transitions. [2020-10-20 03:00:17,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6684 transitions. [2020-10-20 03:00:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:00:17,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:17,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:17,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:00:17,026 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:17,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1715409899, now seen corresponding path program 1 times [2020-10-20 03:00:17,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:17,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95850242] [2020-10-20 03:00:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:17,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95850242] [2020-10-20 03:00:17,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:17,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:17,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115320914] [2020-10-20 03:00:17,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:17,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:17,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:17,136 INFO L87 Difference]: Start difference. First operand 1890 states and 6684 transitions. Second operand 6 states. [2020-10-20 03:00:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:17,261 INFO L93 Difference]: Finished difference Result 2278 states and 7762 transitions. [2020-10-20 03:00:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:17,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 03:00:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:17,267 INFO L225 Difference]: With dead ends: 2278 [2020-10-20 03:00:17,268 INFO L226 Difference]: Without dead ends: 1794 [2020-10-20 03:00:17,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:00:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2020-10-20 03:00:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1626. [2020-10-20 03:00:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-20 03:00:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5600 transitions. [2020-10-20 03:00:17,317 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5600 transitions. Word has length 16 [2020-10-20 03:00:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:17,318 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5600 transitions. [2020-10-20 03:00:17,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5600 transitions. [2020-10-20 03:00:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:00:17,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:17,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:17,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:00:17,323 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1817459975, now seen corresponding path program 1 times [2020-10-20 03:00:17,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:17,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055519442] [2020-10-20 03:00:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:17,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055519442] [2020-10-20 03:00:17,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:17,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:17,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992529185] [2020-10-20 03:00:17,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:00:17,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:00:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:00:17,375 INFO L87 Difference]: Start difference. First operand 1626 states and 5600 transitions. Second operand 4 states. [2020-10-20 03:00:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:17,416 INFO L93 Difference]: Finished difference Result 1696 states and 5312 transitions. [2020-10-20 03:00:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:00:17,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 03:00:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:17,421 INFO L225 Difference]: With dead ends: 1696 [2020-10-20 03:00:17,422 INFO L226 Difference]: Without dead ends: 1296 [2020-10-20 03:00:17,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-10-20 03:00:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2020-10-20 03:00:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2020-10-20 03:00:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4040 transitions. [2020-10-20 03:00:17,480 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4040 transitions. Word has length 17 [2020-10-20 03:00:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:17,481 INFO L481 AbstractCegarLoop]: Abstraction has 1296 states and 4040 transitions. [2020-10-20 03:00:17,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:00:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4040 transitions. [2020-10-20 03:00:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 03:00:17,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:17,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:17,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:00:17,485 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1047833445, now seen corresponding path program 1 times [2020-10-20 03:00:17,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:17,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895772514] [2020-10-20 03:00:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:17,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895772514] [2020-10-20 03:00:17,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:17,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:00:17,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250740552] [2020-10-20 03:00:17,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:17,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:17,558 INFO L87 Difference]: Start difference. First operand 1296 states and 4040 transitions. Second operand 5 states. [2020-10-20 03:00:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:17,614 INFO L93 Difference]: Finished difference Result 1124 states and 3189 transitions. [2020-10-20 03:00:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:17,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-20 03:00:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:17,618 INFO L225 Difference]: With dead ends: 1124 [2020-10-20 03:00:17,618 INFO L226 Difference]: Without dead ends: 868 [2020-10-20 03:00:17,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-10-20 03:00:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2020-10-20 03:00:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2020-10-20 03:00:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2424 transitions. [2020-10-20 03:00:17,642 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2424 transitions. Word has length 18 [2020-10-20 03:00:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:17,642 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 2424 transitions. [2020-10-20 03:00:17,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2424 transitions. [2020-10-20 03:00:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:00:17,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:17,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:17,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:00:17,648 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1687389071, now seen corresponding path program 1 times [2020-10-20 03:00:17,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:17,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590901454] [2020-10-20 03:00:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:17,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590901454] [2020-10-20 03:00:17,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:17,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:00:17,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285981646] [2020-10-20 03:00:17,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:00:17,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:00:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:17,746 INFO L87 Difference]: Start difference. First operand 868 states and 2424 transitions. Second operand 7 states. [2020-10-20 03:00:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:17,846 INFO L93 Difference]: Finished difference Result 1278 states and 3503 transitions. [2020-10-20 03:00:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:17,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-20 03:00:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:17,849 INFO L225 Difference]: With dead ends: 1278 [2020-10-20 03:00:17,849 INFO L226 Difference]: Without dead ends: 638 [2020-10-20 03:00:17,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:00:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-10-20 03:00:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2020-10-20 03:00:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-10-20 03:00:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1685 transitions. [2020-10-20 03:00:17,869 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1685 transitions. Word has length 20 [2020-10-20 03:00:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:17,870 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 1685 transitions. [2020-10-20 03:00:17,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:00:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1685 transitions. [2020-10-20 03:00:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:00:17,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:17,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:00:17,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 03:00:17,873 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash 219006172, now seen corresponding path program 1 times [2020-10-20 03:00:17,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:17,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226734246] [2020-10-20 03:00:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:17,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226734246] [2020-10-20 03:00:17,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:17,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:00:17,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395521934] [2020-10-20 03:00:17,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:00:17,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:00:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:00:17,947 INFO L87 Difference]: Start difference. First operand 638 states and 1685 transitions. Second operand 6 states. [2020-10-20 03:00:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:18,024 INFO L93 Difference]: Finished difference Result 520 states and 1317 transitions. [2020-10-20 03:00:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:00:18,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 03:00:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:18,027 INFO L225 Difference]: With dead ends: 520 [2020-10-20 03:00:18,027 INFO L226 Difference]: Without dead ends: 426 [2020-10-20 03:00:18,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-20 03:00:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-20 03:00:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-20 03:00:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1079 transitions. [2020-10-20 03:00:18,037 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1079 transitions. Word has length 20 [2020-10-20 03:00:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:18,038 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1079 transitions. [2020-10-20 03:00:18,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:00:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1079 transitions. [2020-10-20 03:00:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 03:00:18,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:18,040 INFO L422 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] [2020-10-20 03:00:18,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 03:00:18,041 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1767785942, now seen corresponding path program 1 times [2020-10-20 03:00:18,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:18,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002010823] [2020-10-20 03:00:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:18,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002010823] [2020-10-20 03:00:18,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:18,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:00:18,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611856988] [2020-10-20 03:00:18,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:00:18,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:00:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:00:18,103 INFO L87 Difference]: Start difference. First operand 426 states and 1079 transitions. Second operand 5 states. [2020-10-20 03:00:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:18,153 INFO L93 Difference]: Finished difference Result 578 states and 1408 transitions. [2020-10-20 03:00:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:00:18,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-10-20 03:00:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:18,155 INFO L225 Difference]: With dead ends: 578 [2020-10-20 03:00:18,156 INFO L226 Difference]: Without dead ends: 368 [2020-10-20 03:00:18,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-10-20 03:00:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2020-10-20 03:00:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-10-20 03:00:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 839 transitions. [2020-10-20 03:00:18,167 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 839 transitions. Word has length 23 [2020-10-20 03:00:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:18,167 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 839 transitions. [2020-10-20 03:00:18,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:00:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 839 transitions. [2020-10-20 03:00:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 03:00:18,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:18,170 INFO L422 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] [2020-10-20 03:00:18,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 03:00:18,170 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1492688256, now seen corresponding path program 1 times [2020-10-20 03:00:18,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:18,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519183948] [2020-10-20 03:00:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:00:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:00:18,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519183948] [2020-10-20 03:00:18,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:00:18,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:00:18,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910026942] [2020-10-20 03:00:18,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:00:18,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:00:18,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:00:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:00:18,257 INFO L87 Difference]: Start difference. First operand 364 states and 839 transitions. Second operand 7 states. [2020-10-20 03:00:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:00:18,323 INFO L93 Difference]: Finished difference Result 334 states and 780 transitions. [2020-10-20 03:00:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 03:00:18,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-20 03:00:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:00:18,325 INFO L225 Difference]: With dead ends: 334 [2020-10-20 03:00:18,326 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 03:00:18,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:00:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 03:00:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-20 03:00:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 03:00:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 191 transitions. [2020-10-20 03:00:18,330 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 191 transitions. Word has length 23 [2020-10-20 03:00:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:00:18,330 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 191 transitions. [2020-10-20 03:00:18,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:00:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 191 transitions. [2020-10-20 03:00:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 03:00:18,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:00:18,332 INFO L422 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] [2020-10-20 03:00:18,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 03:00:18,332 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:00:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:00:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1849601120, now seen corresponding path program 1 times [2020-10-20 03:00:18,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:00:18,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323430831] [2020-10-20 03:00:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:00:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:00:18,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:00:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:00:18,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:00:18,438 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:00:18,438 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:00:18,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 03:00:18,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,463 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-20 03:00:18,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,469 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,472 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,491 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:00:18 BasicIcfg [2020-10-20 03:00:18,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:00:18,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:00:18,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:00:18,573 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:00:18,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:00:05" (3/4) ... [2020-10-20 03:00:18,577 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:00:18,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,589 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-20 03:00:18,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:00:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:00:18,751 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:00:18,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:00:18,753 INFO L168 Benchmark]: Toolchain (without parser) took 16637.89 ms. Allocated memory was 36.7 MB in the beginning and 207.6 MB in the end (delta: 170.9 MB). Free memory was 16.7 MB in the beginning and 124.1 MB in the end (delta: -107.4 MB). Peak memory consumption was 63.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,754 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 34.1 MB. Free memory was 11.1 MB in the beginning and 11.1 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.51 ms. Allocated memory was 36.7 MB in the beginning and 46.1 MB in the end (delta: 9.4 MB). Free memory was 15.9 MB in the beginning and 12.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.13 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 12.9 MB in the beginning and 26.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 646.6 kB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,755 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 46.7 MB. Free memory was 26.8 MB in the beginning and 24.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,755 INFO L168 Benchmark]: RCFGBuilder took 2189.61 ms. Allocated memory was 46.7 MB in the beginning and 64.0 MB in the end (delta: 17.3 MB). Free memory was 24.2 MB in the beginning and 11.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,756 INFO L168 Benchmark]: TraceAbstraction took 13378.46 ms. Allocated memory was 64.0 MB in the beginning and 207.6 MB in the end (delta: 143.7 MB). Free memory was 10.8 MB in the beginning and 145.9 MB in the end (delta: -135.1 MB). Peak memory consumption was 104.4 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,756 INFO L168 Benchmark]: Witness Printer took 179.03 ms. Allocated memory is still 207.6 MB. Free memory was 145.9 MB in the beginning and 124.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:00:18,760 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 34.1 MB. Free memory was 11.1 MB in the beginning and 11.1 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 753.51 ms. Allocated memory was 36.7 MB in the beginning and 46.1 MB in the end (delta: 9.4 MB). Free memory was 15.9 MB in the beginning and 12.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 84.13 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 12.9 MB in the beginning and 26.8 MB in the end (delta: -13.9 MB). Peak memory consumption was 646.6 kB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 46.7 MB. Free memory was 26.8 MB in the beginning and 24.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2189.61 ms. Allocated memory was 46.7 MB in the beginning and 64.0 MB in the end (delta: 17.3 MB). Free memory was 24.2 MB in the beginning and 11.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 13378.46 ms. Allocated memory was 64.0 MB in the beginning and 207.6 MB in the end (delta: 143.7 MB). Free memory was 10.8 MB in the beginning and 145.9 MB in the end (delta: -135.1 MB). Peak memory consumption was 104.4 MB. Max. memory is 14.3 GB. * Witness Printer took 179.03 ms. Allocated memory is still 207.6 MB. Free memory was 145.9 MB in the beginning and 124.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1738 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.6s, 126 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 6442 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 687 SDtfs, 856 SDslu, 1276 SDs, 0 SdLazy, 538 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 884 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 25030 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! Received shutdown request...