./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix032_power.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/mix032_power.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 11c6212e3631337e27f93f651458f53a0a2aff6b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:55:42,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:55:42,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:55:42,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:55:42,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:55:42,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:55:42,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:55:42,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:55:42,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:55:42,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:55:42,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:55:42,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:55:42,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:55:42,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:55:42,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:55:42,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:55:42,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:55:42,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:55:42,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:55:42,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:55:42,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:55:42,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:55:42,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:55:42,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:55:42,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:55:42,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:55:42,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:55:42,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:55:42,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:55:42,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:55:42,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:55:42,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:55:42,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:55:42,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:55:42,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:55:42,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:55:42,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:55:42,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:55:42,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:55:42,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:55:42,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:55:42,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 02:55:42,735 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:55:42,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:55:42,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:55:42,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:55:42,737 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:55:42,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:55:42,738 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:55:42,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:55:42,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:55:42,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:55:42,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:55:42,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:55:42,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:55:42,740 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:55:42,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:55:42,740 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:55:42,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:55:42,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:55:42,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:55:42,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:55:42,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:55:42,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:55:42,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:55:42,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:55:42,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:55:42,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:55:42,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:55:42,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:55:42,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:55:42,752 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 -> 11c6212e3631337e27f93f651458f53a0a2aff6b [2020-10-20 02:55:42,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:55:42,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:55:42,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:55:42,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:55:42,974 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:55:42,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2020-10-20 02:55:43,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc5eb333/5a46efaffeda4ba7a0bdc655ec0610fe/FLAG6fb730241 [2020-10-20 02:55:43,678 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:55:43,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2020-10-20 02:55:43,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc5eb333/5a46efaffeda4ba7a0bdc655ec0610fe/FLAG6fb730241 [2020-10-20 02:55:43,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc5eb333/5a46efaffeda4ba7a0bdc655ec0610fe [2020-10-20 02:55:43,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:55:43,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:55:43,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:55:43,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:55:43,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:55:43,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:55:43" (1/1) ... [2020-10-20 02:55:43,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2350664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:43, skipping insertion in model container [2020-10-20 02:55:43,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:55:43" (1/1) ... [2020-10-20 02:55:43,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:55:43,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:55:44,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:55:44,555 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:55:44,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:55:44,712 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:55:44,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44 WrapperNode [2020-10-20 02:55:44,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:55:44,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:55:44,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:55:44,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:55:44,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:55:44,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:55:44,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:55:44,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:55:44,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (1/1) ... [2020-10-20 02:55:44,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:55:44,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:55:44,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:55:44,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:55:44,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (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 02:55:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:55:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:55:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:55:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:55:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 02:55:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 02:55:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 02:55:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 02:55:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 02:55:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 02:55:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:55:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:55:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:55:44,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:55:44,926 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 02:55:47,337 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:55:47,337 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 02:55:47,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:55:47 BoogieIcfgContainer [2020-10-20 02:55:47,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:55:47,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:55:47,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:55:47,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:55:47,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:55:43" (1/3) ... [2020-10-20 02:55:47,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788c0683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:55:47, skipping insertion in model container [2020-10-20 02:55:47,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:55:44" (2/3) ... [2020-10-20 02:55:47,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788c0683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:55:47, skipping insertion in model container [2020-10-20 02:55:47,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:55:47" (3/3) ... [2020-10-20 02:55:47,357 INFO L111 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2020-10-20 02:55:47,370 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:55:47,371 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:55:47,381 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 02:55:47,382 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:55:47,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,436 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,437 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,448 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,448 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,466 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,467 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:55:47,487 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 02:55:47,541 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 02:55:47,565 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:55:47,566 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:55:47,566 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:55:47,566 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:55:47,566 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:55:47,566 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:55:47,566 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:55:47,567 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:55:47,588 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:55:47,591 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions, 237 flow [2020-10-20 02:55:47,595 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 111 transitions, 237 flow [2020-10-20 02:55:47,597 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 237 flow [2020-10-20 02:55:47,687 INFO L129 PetriNetUnfolder]: 3/108 cut-off events. [2020-10-20 02:55:47,688 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 02:55:47,693 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-10-20 02:55:47,697 INFO L117 LiptonReduction]: Number of co-enabled transitions 2262 [2020-10-20 02:55:47,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:47,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:47,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:47,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:47,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:47,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:47,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:47,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:47,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,436 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-20 02:55:48,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:55:48,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:55:48,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:55:48,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:55:48,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:48,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:48,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:48,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:55:48,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 02:55:48,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:55:48,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:48,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:48,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:48,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:48,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:48,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,258 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 02:55:49,366 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-20 02:55:49,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:55:49,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:49,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:49,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:49,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:49,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:49,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:49,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:49,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:49,991 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 02:55:50,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:55:50,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:55:50,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:55:50,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:55:50,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:55:50,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:55:50,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:55:50,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:55:50,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:50,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:50,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:55:50,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:50,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:55:50,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:50,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:55:50,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:55:50,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:55:50,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:55:51,146 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-20 02:55:52,030 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-20 02:55:52,230 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-20 02:55:52,238 INFO L132 LiptonReduction]: Checked pairs total: 5697 [2020-10-20 02:55:52,238 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-20 02:55:52,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-20 02:55:52,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-10-20 02:55:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-10-20 02:55:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-20 02:55:52,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:52,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-20 02:55:52,338 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1119136, now seen corresponding path program 1 times [2020-10-20 02:55:52,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:52,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820202916] [2020-10-20 02:55:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:52,600 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 02:55:52,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820202916] [2020-10-20 02:55:52,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:52,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:55:52,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91217864] [2020-10-20 02:55:52,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:55:52,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:55:52,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:55:52,629 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-10-20 02:55:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:52,775 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-10-20 02:55:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:55:52,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-20 02:55:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:52,809 INFO L225 Difference]: With dead ends: 1152 [2020-10-20 02:55:52,809 INFO L226 Difference]: Without dead ends: 972 [2020-10-20 02:55:52,811 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 02:55:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-10-20 02:55:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-10-20 02:55:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-10-20 02:55:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-10-20 02:55:52,975 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-10-20 02:55:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:52,976 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-10-20 02:55:52,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:55:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-10-20 02:55:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 02:55:52,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:52,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:55:52,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:55:52,979 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1907666414, now seen corresponding path program 1 times [2020-10-20 02:55:52,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:52,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153444801] [2020-10-20 02:55:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:53,154 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 02:55:53,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153444801] [2020-10-20 02:55:53,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:53,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:55:53,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714284014] [2020-10-20 02:55:53,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:55:53,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:53,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:55:53,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:55:53,157 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-10-20 02:55:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:53,197 INFO L93 Difference]: Finished difference Result 1032 states and 3186 transitions. [2020-10-20 02:55:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:55:53,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 02:55:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:53,205 INFO L225 Difference]: With dead ends: 1032 [2020-10-20 02:55:53,205 INFO L226 Difference]: Without dead ends: 852 [2020-10-20 02:55:53,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 02:55:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-10-20 02:55:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-10-20 02:55:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-20 02:55:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-10-20 02:55:53,242 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10 [2020-10-20 02:55:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:53,243 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-10-20 02:55:53,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:55:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-10-20 02:55:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 02:55:53,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:53,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:55:53,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:55:53,248 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1708370747, now seen corresponding path program 1 times [2020-10-20 02:55:53,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:53,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255829657] [2020-10-20 02:55:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:53,344 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 02:55:53,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255829657] [2020-10-20 02:55:53,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:53,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 02:55:53,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780544318] [2020-10-20 02:55:53,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:55:53,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:55:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:55:53,347 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 4 states. [2020-10-20 02:55:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:53,376 INFO L93 Difference]: Finished difference Result 892 states and 2724 transitions. [2020-10-20 02:55:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:55:53,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 02:55:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:53,383 INFO L225 Difference]: With dead ends: 892 [2020-10-20 02:55:53,383 INFO L226 Difference]: Without dead ends: 772 [2020-10-20 02:55:53,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 02:55:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-10-20 02:55:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-10-20 02:55:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-20 02:55:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-10-20 02:55:53,410 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12 [2020-10-20 02:55:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:53,410 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-10-20 02:55:53,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:55:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-10-20 02:55:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 02:55:53,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:53,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:55:53,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:55:53,414 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash 3936465, now seen corresponding path program 1 times [2020-10-20 02:55:53,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:53,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673640101] [2020-10-20 02:55:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:53,514 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 02:55:53,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673640101] [2020-10-20 02:55:53,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:53,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:55:53,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626805663] [2020-10-20 02:55:53,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:55:53,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:55:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:55:53,516 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 4 states. [2020-10-20 02:55:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:53,553 INFO L93 Difference]: Finished difference Result 680 states and 1854 transitions. [2020-10-20 02:55:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:55:53,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 02:55:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:53,557 INFO L225 Difference]: With dead ends: 680 [2020-10-20 02:55:53,557 INFO L226 Difference]: Without dead ends: 500 [2020-10-20 02:55:53,558 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 02:55:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-20 02:55:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-10-20 02:55:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-20 02:55:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1310 transitions. [2020-10-20 02:55:53,591 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1310 transitions. Word has length 14 [2020-10-20 02:55:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:53,592 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1310 transitions. [2020-10-20 02:55:53,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:55:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1310 transitions. [2020-10-20 02:55:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:55:53,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:53,594 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 02:55:53,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:55:53,595 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1295470890, now seen corresponding path program 1 times [2020-10-20 02:55:53,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:53,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64810168] [2020-10-20 02:55:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:53,760 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 02:55:53,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64810168] [2020-10-20 02:55:53,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:53,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:55:53,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852180985] [2020-10-20 02:55:53,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:55:53,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:55:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:55:53,762 INFO L87 Difference]: Start difference. First operand 500 states and 1310 transitions. Second operand 5 states. [2020-10-20 02:55:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:53,809 INFO L93 Difference]: Finished difference Result 384 states and 931 transitions. [2020-10-20 02:55:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:55:53,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-20 02:55:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:53,813 INFO L225 Difference]: With dead ends: 384 [2020-10-20 02:55:53,813 INFO L226 Difference]: Without dead ends: 304 [2020-10-20 02:55:53,813 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 02:55:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-20 02:55:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-20 02:55:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-20 02:55:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-10-20 02:55:53,822 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 17 [2020-10-20 02:55:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:53,822 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-10-20 02:55:53,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:55:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-10-20 02:55:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:55:53,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:53,824 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 02:55:53,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:55:53,825 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1821402971, now seen corresponding path program 1 times [2020-10-20 02:55:53,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:53,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406827553] [2020-10-20 02:55:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:53,972 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 02:55:53,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406827553] [2020-10-20 02:55:53,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:53,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:55:53,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178697581] [2020-10-20 02:55:53,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:55:53,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:55:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:55:53,974 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 6 states. [2020-10-20 02:55:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:54,048 INFO L93 Difference]: Finished difference Result 271 states and 654 transitions. [2020-10-20 02:55:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:55:54,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 02:55:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:54,052 INFO L225 Difference]: With dead ends: 271 [2020-10-20 02:55:54,052 INFO L226 Difference]: Without dead ends: 256 [2020-10-20 02:55:54,053 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 02:55:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-20 02:55:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-20 02:55:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-20 02:55:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-10-20 02:55:54,061 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-10-20 02:55:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:54,061 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-10-20 02:55:54,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:55:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-10-20 02:55:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:55:54,063 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:54,063 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] [2020-10-20 02:55:54,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:55:54,064 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1858702280, now seen corresponding path program 1 times [2020-10-20 02:55:54,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:54,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025401778] [2020-10-20 02:55:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:54,476 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 02:55:54,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025401778] [2020-10-20 02:55:54,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:54,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:55:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804366821] [2020-10-20 02:55:54,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:55:54,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:55:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:55:54,479 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 8 states. [2020-10-20 02:55:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:54,775 INFO L93 Difference]: Finished difference Result 363 states and 841 transitions. [2020-10-20 02:55:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:55:54,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-20 02:55:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:54,778 INFO L225 Difference]: With dead ends: 363 [2020-10-20 02:55:54,778 INFO L226 Difference]: Without dead ends: 260 [2020-10-20 02:55:54,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:55:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-20 02:55:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2020-10-20 02:55:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-10-20 02:55:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 538 transitions. [2020-10-20 02:55:54,787 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 538 transitions. Word has length 24 [2020-10-20 02:55:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:54,787 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 538 transitions. [2020-10-20 02:55:54,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:55:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 538 transitions. [2020-10-20 02:55:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:55:54,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:54,789 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] [2020-10-20 02:55:54,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:55:54,790 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -510452910, now seen corresponding path program 2 times [2020-10-20 02:55:54,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:54,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999146806] [2020-10-20 02:55:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:55:55,032 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 02:55:55,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999146806] [2020-10-20 02:55:55,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:55:55,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:55:55,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718604399] [2020-10-20 02:55:55,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 02:55:55,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:55:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 02:55:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:55:55,035 INFO L87 Difference]: Start difference. First operand 232 states and 538 transitions. Second operand 8 states. [2020-10-20 02:55:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:55:55,335 INFO L93 Difference]: Finished difference Result 308 states and 699 transitions. [2020-10-20 02:55:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 02:55:55,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-20 02:55:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:55:55,338 INFO L225 Difference]: With dead ends: 308 [2020-10-20 02:55:55,338 INFO L226 Difference]: Without dead ends: 273 [2020-10-20 02:55:55,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-20 02:55:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-20 02:55:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 192. [2020-10-20 02:55:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-20 02:55:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 448 transitions. [2020-10-20 02:55:55,346 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 448 transitions. Word has length 24 [2020-10-20 02:55:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:55:55,346 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 448 transitions. [2020-10-20 02:55:55,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 02:55:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 448 transitions. [2020-10-20 02:55:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 02:55:55,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:55:55,348 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] [2020-10-20 02:55:55,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:55:55,349 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:55:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:55:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 223529298, now seen corresponding path program 3 times [2020-10-20 02:55:55,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:55:55,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132219757] [2020-10-20 02:55:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:55:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:55:55,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:55:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:55:55,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:55:55,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:55:55,514 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:55:55,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:55:55,549 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 02:55:55,549 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [752] [2020-10-20 02:55:55,552 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 02:55:55,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,552 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 02:55:55,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,553 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 02:55:55,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,554 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 02:55:55,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,554 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 02:55:55,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,555 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 02:55:55,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,557 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 02:55:55,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,558 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 02:55:55,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,558 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 02:55:55,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,559 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 02:55:55,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,559 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 02:55:55,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,560 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 02:55:55,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,560 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 02:55:55,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,561 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 02:55:55,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,562 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 02:55:55,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,562 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 02:55:55,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,563 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 02:55:55,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,563 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 02:55:55,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,564 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 02:55:55,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,565 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 02:55:55,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,565 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 02:55:55,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,566 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 02:55:55,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,566 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 02:55:55,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,567 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 02:55:55,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,568 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 02:55:55,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,568 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 02:55:55,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,569 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 02:55:55,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,570 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 02:55:55,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,571 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 02:55:55,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,572 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 02:55:55,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,573 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 02:55:55,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,573 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 02:55:55,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,574 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 02:55:55,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,574 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 02:55:55,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:55:55 BasicIcfg [2020-10-20 02:55:55,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:55:55,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:55:55,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:55:55,701 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:55:55,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:55:47" (3/4) ... [2020-10-20 02:55:55,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:55:55,725 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 02:55:55,726 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [752] [2020-10-20 02:55:55,727 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 02:55:55,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,727 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 02:55:55,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,727 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 02:55:55,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,728 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 02:55:55,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,728 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 02:55:55,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,728 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 02:55:55,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,729 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 02:55:55,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,730 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 02:55:55,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,730 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 02:55:55,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,731 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 02:55:55,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,732 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 02:55:55,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,732 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 02:55:55,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,733 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 02:55:55,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,733 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 02:55:55,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,734 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 02:55:55,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,735 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 02:55:55,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,735 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 02:55:55,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,736 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 02:55:55,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,736 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 02:55:55,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,737 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 02:55:55,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,738 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 02:55:55,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,738 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 02:55:55,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,739 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 02:55:55,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,739 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 02:55:55,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,740 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 02:55:55,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,740 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 02:55:55,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,741 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 02:55:55,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,742 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 02:55:55,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,742 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 02:55:55,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,743 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 02:55:55,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,744 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 02:55:55,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,744 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 02:55:55,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,745 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 02:55:55,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,745 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 02:55:55,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:55:55,891 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:55:55,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:55:55,893 INFO L168 Benchmark]: Toolchain (without parser) took 12009.15 ms. Allocated memory was 37.7 MB in the beginning and 136.3 MB in the end (delta: 98.6 MB). Free memory was 13.7 MB in the beginning and 98.2 MB in the end (delta: -84.5 MB). Peak memory consumption was 101.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,893 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 37.2 MB. Free memory is still 18.5 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 02:55:55,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.19 ms. Allocated memory was 37.7 MB in the beginning and 48.8 MB in the end (delta: 11.0 MB). Free memory was 12.8 MB in the beginning and 21.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.74 ms. Allocated memory is still 48.8 MB. Free memory was 21.0 MB in the beginning and 18.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,895 INFO L168 Benchmark]: Boogie Preprocessor took 43.36 ms. Allocated memory is still 48.8 MB. Free memory was 18.0 MB in the beginning and 15.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,896 INFO L168 Benchmark]: RCFGBuilder took 2522.48 ms. Allocated memory was 48.8 MB in the beginning and 71.8 MB in the end (delta: 23.1 MB). Free memory was 15.5 MB in the beginning and 27.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,897 INFO L168 Benchmark]: TraceAbstraction took 8353.70 ms. Allocated memory was 71.8 MB in the beginning and 136.3 MB in the end (delta: 64.5 MB). Free memory was 27.4 MB in the beginning and 31.8 MB in the end (delta: -4.4 MB). Peak memory consumption was 60.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,897 INFO L168 Benchmark]: Witness Printer took 191.88 ms. Allocated memory is still 136.3 MB. Free memory was 31.8 MB in the beginning and 98.2 MB in the end (delta: -66.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:55:55,901 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.34 ms. Allocated memory is still 37.2 MB. Free memory is still 18.5 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 821.19 ms. Allocated memory was 37.7 MB in the beginning and 48.8 MB in the end (delta: 11.0 MB). Free memory was 12.8 MB in the beginning and 21.0 MB in the end (delta: -8.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 59.74 ms. Allocated memory is still 48.8 MB. Free memory was 21.0 MB in the beginning and 18.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 43.36 ms. Allocated memory is still 48.8 MB. Free memory was 18.0 MB in the beginning and 15.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2522.48 ms. Allocated memory was 48.8 MB in the beginning and 71.8 MB in the end (delta: 23.1 MB). Free memory was 15.5 MB in the beginning and 27.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 8353.70 ms. Allocated memory was 71.8 MB in the beginning and 136.3 MB in the end (delta: 64.5 MB). Free memory was 27.4 MB in the beginning and 31.8 MB in the end (delta: -4.4 MB). Peak memory consumption was 60.1 MB. Max. memory is 14.3 GB. * Witness Printer took 191.88 ms. Allocated memory is still 136.3 MB. Free memory was 31.8 MB in the beginning and 98.2 MB in the end (delta: -66.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1466 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 171 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 118 PlacesBefore, 39 PlacesAfterwards, 111 TransitionsBefore, 30 TransitionsAfterwards, 2262 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5697 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t851; [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L821] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1 [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0) [L822] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L827] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix032_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 273 SDtfs, 325 SDslu, 684 SDs, 0 SdLazy, 276 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred 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: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 109 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 15723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...