./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix043_pso.opt.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/mix043_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b95780b7ec006a443b33ca388edf99bdef71413 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:57:30,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:57:30,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:57:30,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:57:30,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:57:30,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:57:30,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:57:30,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:57:30,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:57:30,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:57:30,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:57:30,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:57:30,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:57:30,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:57:30,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:57:30,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:57:30,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:57:30,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:57:30,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:57:30,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:57:30,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:57:30,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:57:30,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:57:30,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:57:30,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:57:30,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:57:30,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:57:30,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:57:30,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:57:30,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:57:30,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:57:30,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:57:30,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:57:30,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:57:30,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:57:30,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:57:30,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:57:30,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:57:30,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:57:30,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:57:30,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:57:30,777 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:57:30,811 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:57:30,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:57:30,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:57:30,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:57:30,813 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:57:30,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:57:30,814 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:57:30,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:57:30,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:57:30,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:57:30,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:57:30,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:57:30,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:57:30,815 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:57:30,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:57:30,815 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:57:30,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:57:30,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:57:30,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:57:30,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:57:30,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:57:30,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:57:30,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:57:30,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:57:30,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:57:30,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:57:30,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:57:30,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:57:30,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:57:30,818 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 -> 5b95780b7ec006a443b33ca388edf99bdef71413 [2020-10-20 02:57:31,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:57:31,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:57:31,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:57:31,065 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:57:31,065 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:57:31,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i [2020-10-20 02:57:31,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2949b85/0e1f99dabb194092b4f2df7f5e847a5f/FLAG98e023e59 [2020-10-20 02:57:31,796 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:57:31,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043_pso.opt.i [2020-10-20 02:57:31,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2949b85/0e1f99dabb194092b4f2df7f5e847a5f/FLAG98e023e59 [2020-10-20 02:57:31,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2949b85/0e1f99dabb194092b4f2df7f5e847a5f [2020-10-20 02:57:31,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:57:31,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:57:31,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:57:31,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:57:31,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:57:31,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:57:31" (1/1) ... [2020-10-20 02:57:31,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3079f3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:31, skipping insertion in model container [2020-10-20 02:57:31,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:57:31" (1/1) ... [2020-10-20 02:57:31,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:57:32,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:57:32,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:57:32,522 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:57:32,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:57:32,684 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:57:32,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32 WrapperNode [2020-10-20 02:57:32,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:57:32,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:57:32,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:57:32,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:57:32,696 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:57:32" (1/1) ... [2020-10-20 02:57:32,720 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:57:32" (1/1) ... [2020-10-20 02:57:32,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:57:32,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:57:32,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:57:32,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:57:32,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (1/1) ... [2020-10-20 02:57:32,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:57:32,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:57:32,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:57:32,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:57:32,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (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:57:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:57:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:57:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:57:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:57:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 02:57:32,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 02:57:32,879 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 02:57:32,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 02:57:32,879 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 02:57:32,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 02:57:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-20 02:57:32,880 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-20 02:57:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:57:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:57:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:57:32,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:57:32,883 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:57:35,075 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:57:35,075 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 02:57:35,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:35 BoogieIcfgContainer [2020-10-20 02:57:35,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:57:35,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:57:35,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:57:35,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:57:35,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:57:31" (1/3) ... [2020-10-20 02:57:35,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd5a196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:57:35, skipping insertion in model container [2020-10-20 02:57:35,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:57:32" (2/3) ... [2020-10-20 02:57:35,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd5a196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:57:35, skipping insertion in model container [2020-10-20 02:57:35,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:35" (3/3) ... [2020-10-20 02:57:35,087 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2020-10-20 02:57:35,100 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:57:35,100 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:57:35,108 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 02:57:35,109 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:57:35,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,146 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,146 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,149 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,150 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,150 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,165 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,165 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,167 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,171 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,171 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:57:35,173 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 02:57:35,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 02:57:35,213 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:57:35,213 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:57:35,213 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:57:35,213 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:57:35,214 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:57:35,214 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:57:35,214 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:57:35,214 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:57:35,230 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:57:35,233 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-20 02:57:35,236 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-20 02:57:35,238 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-10-20 02:57:35,325 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-10-20 02:57:35,326 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 02:57:35,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-20 02:57:35,336 INFO L117 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-20 02:57:35,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:35,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:35,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:35,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:35,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:35,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:35,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:35,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:35,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:36,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:57:36,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:36,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:57:36,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:36,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-20 02:57:36,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:36,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:57:36,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:37,391 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-20 02:57:37,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-20 02:57:37,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:37,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-20 02:57:37,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:38,786 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-20 02:57:39,051 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-10-20 02:57:39,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:39,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:39,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:39,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:57:39,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:39,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:57:39,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:40,341 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-20 02:57:41,199 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-20 02:57:41,599 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-20 02:57:41,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 02:57:41,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:41,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:41,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:41,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:41,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:41,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:42,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:42,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:42,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:42,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:42,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:42,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:42,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:42,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:42,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:42,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:42,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:43,335 WARN L193 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2020-10-20 02:57:43,647 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-20 02:57:43,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-10-20 02:57:43,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:43,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-10-20 02:57:43,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:43,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:43,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:43,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:43,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:43,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:43,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:43,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:43,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:43,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:43,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:43,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:43,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:43,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:45,360 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 145 DAG size of output: 136 [2020-10-20 02:57:45,982 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 132 [2020-10-20 02:57:46,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-10-20 02:57:46,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-10-20 02:57:46,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:46,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:46,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:46,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:46,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:46,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:57:46,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 02:57:46,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:46,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-10-20 02:57:46,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-10-20 02:57:46,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:57:46,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-10-20 02:57:46,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-10-20 02:57:46,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:57:46,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-10-20 02:57:46,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:57:46,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:57:46,995 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-20 02:57:47,226 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-20 02:57:47,613 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-20 02:57:48,019 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-20 02:57:48,071 INFO L132 LiptonReduction]: Checked pairs total: 6354 [2020-10-20 02:57:48,071 INFO L134 LiptonReduction]: Total number of compositions: 103 [2020-10-20 02:57:48,078 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-20 02:57:48,485 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-20 02:57:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-20 02:57:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:57:48,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:48,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:48,499 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2090102638, now seen corresponding path program 1 times [2020-10-20 02:57:48,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:48,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986256251] [2020-10-20 02:57:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:48,793 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:57:48,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986256251] [2020-10-20 02:57:48,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:48,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:57:48,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496814597] [2020-10-20 02:57:48,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:57:48,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:57:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:57:48,820 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-20 02:57:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:48,990 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-20 02:57:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:57:48,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 02:57:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:49,046 INFO L225 Difference]: With dead ends: 2602 [2020-10-20 02:57:49,046 INFO L226 Difference]: Without dead ends: 2122 [2020-10-20 02:57:49,049 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:57:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-20 02:57:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-20 02:57:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-20 02:57:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-20 02:57:49,236 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-20 02:57:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:49,237 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-20 02:57:49,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:57:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-20 02:57:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 02:57:49,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:49,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:49,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:57:49,245 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1455991290, now seen corresponding path program 1 times [2020-10-20 02:57:49,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:49,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644085680] [2020-10-20 02:57:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:49,379 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:57:49,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644085680] [2020-10-20 02:57:49,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:49,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:57:49,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982288745] [2020-10-20 02:57:49,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:57:49,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:57:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:57:49,386 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-20 02:57:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:49,416 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-20 02:57:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:57:49,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 02:57:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:49,434 INFO L225 Difference]: With dead ends: 1962 [2020-10-20 02:57:49,434 INFO L226 Difference]: Without dead ends: 1962 [2020-10-20 02:57:49,435 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:57:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-20 02:57:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-20 02:57:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-20 02:57:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-20 02:57:49,748 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 11 [2020-10-20 02:57:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:49,749 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-20 02:57:49,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:57:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-20 02:57:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 02:57:49,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:49,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:49,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:57:49,753 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash 951680485, now seen corresponding path program 1 times [2020-10-20 02:57:49,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:49,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019149534] [2020-10-20 02:57:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:49,954 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:57:49,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019149534] [2020-10-20 02:57:49,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:49,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:49,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750878853] [2020-10-20 02:57:49,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:57:49,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:57:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:49,956 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-10-20 02:57:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:50,064 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-10-20 02:57:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 02:57:50,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-20 02:57:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:50,082 INFO L225 Difference]: With dead ends: 1898 [2020-10-20 02:57:50,082 INFO L226 Difference]: Without dead ends: 1898 [2020-10-20 02:57:50,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-20 02:57:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-20 02:57:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-20 02:57:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-10-20 02:57:50,162 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-10-20 02:57:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:50,162 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-10-20 02:57:50,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:57:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-10-20 02:57:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 02:57:50,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:50,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:50,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:57:50,167 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 343190440, now seen corresponding path program 1 times [2020-10-20 02:57:50,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:50,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969179561] [2020-10-20 02:57:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:50,353 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:57:50,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969179561] [2020-10-20 02:57:50,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:50,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:57:50,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588708368] [2020-10-20 02:57:50,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:50,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:50,355 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 6 states. [2020-10-20 02:57:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:50,529 INFO L93 Difference]: Finished difference Result 2154 states and 8016 transitions. [2020-10-20 02:57:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:50,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-20 02:57:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:50,548 INFO L225 Difference]: With dead ends: 2154 [2020-10-20 02:57:50,549 INFO L226 Difference]: Without dead ends: 2154 [2020-10-20 02:57:50,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-20 02:57:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-20 02:57:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-20 02:57:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8016 transitions. [2020-10-20 02:57:50,631 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8016 transitions. Word has length 15 [2020-10-20 02:57:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:50,632 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8016 transitions. [2020-10-20 02:57:50,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8016 transitions. [2020-10-20 02:57:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 02:57:50,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:50,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:50,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:57:50,636 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash -263159932, now seen corresponding path program 1 times [2020-10-20 02:57:50,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:50,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583313049] [2020-10-20 02:57:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:50,724 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:57:50,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583313049] [2020-10-20 02:57:50,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:50,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:50,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38979912] [2020-10-20 02:57:50,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:50,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:50,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:50,727 INFO L87 Difference]: Start difference. First operand 2154 states and 8016 transitions. Second operand 4 states. [2020-10-20 02:57:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:50,828 INFO L93 Difference]: Finished difference Result 2262 states and 7675 transitions. [2020-10-20 02:57:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:57:50,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 02:57:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:50,842 INFO L225 Difference]: With dead ends: 2262 [2020-10-20 02:57:50,843 INFO L226 Difference]: Without dead ends: 1686 [2020-10-20 02:57:50,843 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:57:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2020-10-20 02:57:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2020-10-20 02:57:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-10-20 02:57:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 5676 transitions. [2020-10-20 02:57:50,901 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 5676 transitions. Word has length 15 [2020-10-20 02:57:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:50,901 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 5676 transitions. [2020-10-20 02:57:50,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 5676 transitions. [2020-10-20 02:57:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 02:57:50,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:50,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:50,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:57:50,905 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:50,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 454346801, now seen corresponding path program 1 times [2020-10-20 02:57:50,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:50,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523135470] [2020-10-20 02:57:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:51,047 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:57:51,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523135470] [2020-10-20 02:57:51,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:51,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:57:51,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913643149] [2020-10-20 02:57:51,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:57:51,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:57:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:57:51,050 INFO L87 Difference]: Start difference. First operand 1686 states and 5676 transitions. Second operand 5 states. [2020-10-20 02:57:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:51,116 INFO L93 Difference]: Finished difference Result 1464 states and 4522 transitions. [2020-10-20 02:57:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:57:51,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-20 02:57:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:51,124 INFO L225 Difference]: With dead ends: 1464 [2020-10-20 02:57:51,125 INFO L226 Difference]: Without dead ends: 1095 [2020-10-20 02:57:51,125 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:57:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-20 02:57:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2020-10-20 02:57:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2020-10-20 02:57:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 3312 transitions. [2020-10-20 02:57:51,155 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 3312 transitions. Word has length 16 [2020-10-20 02:57:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:51,156 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 3312 transitions. [2020-10-20 02:57:51,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:57:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 3312 transitions. [2020-10-20 02:57:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:57:51,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:51,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:51,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:57:51,160 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2006986927, now seen corresponding path program 1 times [2020-10-20 02:57:51,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:51,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226680510] [2020-10-20 02:57:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:51,236 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:57:51,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226680510] [2020-10-20 02:57:51,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:51,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:51,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103748881] [2020-10-20 02:57:51,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:51,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:51,239 INFO L87 Difference]: Start difference. First operand 1095 states and 3312 transitions. Second operand 4 states. [2020-10-20 02:57:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:51,269 INFO L93 Difference]: Finished difference Result 1446 states and 4283 transitions. [2020-10-20 02:57:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 02:57:51,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-20 02:57:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:51,278 INFO L225 Difference]: With dead ends: 1446 [2020-10-20 02:57:51,278 INFO L226 Difference]: Without dead ends: 954 [2020-10-20 02:57:51,279 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:57:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2020-10-20 02:57:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 933. [2020-10-20 02:57:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-10-20 02:57:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2678 transitions. [2020-10-20 02:57:51,337 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2678 transitions. Word has length 19 [2020-10-20 02:57:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:51,337 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 2678 transitions. [2020-10-20 02:57:51,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2678 transitions. [2020-10-20 02:57:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 02:57:51,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:51,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:51,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:57:51,341 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash 262437935, now seen corresponding path program 1 times [2020-10-20 02:57:51,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:51,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958801424] [2020-10-20 02:57:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:51,425 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:57:51,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958801424] [2020-10-20 02:57:51,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:51,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:57:51,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446870495] [2020-10-20 02:57:51,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:51,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:51,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:51,427 INFO L87 Difference]: Start difference. First operand 933 states and 2678 transitions. Second operand 6 states. [2020-10-20 02:57:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:51,499 INFO L93 Difference]: Finished difference Result 806 states and 2276 transitions. [2020-10-20 02:57:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:57:51,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-20 02:57:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:51,505 INFO L225 Difference]: With dead ends: 806 [2020-10-20 02:57:51,505 INFO L226 Difference]: Without dead ends: 704 [2020-10-20 02:57:51,506 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:57:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-10-20 02:57:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2020-10-20 02:57:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-10-20 02:57:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2017 transitions. [2020-10-20 02:57:51,525 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2017 transitions. Word has length 19 [2020-10-20 02:57:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:51,526 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 2017 transitions. [2020-10-20 02:57:51,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2017 transitions. [2020-10-20 02:57:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:57:51,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:51,529 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] [2020-10-20 02:57:51,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:57:51,529 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 87479135, now seen corresponding path program 1 times [2020-10-20 02:57:51,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:51,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122522612] [2020-10-20 02:57:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:51,607 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:57:51,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122522612] [2020-10-20 02:57:51,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:51,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:57:51,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374220626] [2020-10-20 02:57:51,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:51,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:51,611 INFO L87 Difference]: Start difference. First operand 704 states and 2017 transitions. Second operand 6 states. [2020-10-20 02:57:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:51,718 INFO L93 Difference]: Finished difference Result 1141 states and 3199 transitions. [2020-10-20 02:57:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:57:51,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-20 02:57:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:51,724 INFO L225 Difference]: With dead ends: 1141 [2020-10-20 02:57:51,725 INFO L226 Difference]: Without dead ends: 739 [2020-10-20 02:57:51,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-10-20 02:57:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 617. [2020-10-20 02:57:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2020-10-20 02:57:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1627 transitions. [2020-10-20 02:57:51,747 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1627 transitions. Word has length 22 [2020-10-20 02:57:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:51,747 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1627 transitions. [2020-10-20 02:57:51,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1627 transitions. [2020-10-20 02:57:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 02:57:51,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:51,750 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] [2020-10-20 02:57:51,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:57:51,751 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash 123586923, now seen corresponding path program 2 times [2020-10-20 02:57:51,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:51,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419577740] [2020-10-20 02:57:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:51,855 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:57:51,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419577740] [2020-10-20 02:57:51,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:51,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:57:51,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163757765] [2020-10-20 02:57:51,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:57:51,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:57:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:57:51,858 INFO L87 Difference]: Start difference. First operand 617 states and 1627 transitions. Second operand 7 states. [2020-10-20 02:57:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:51,989 INFO L93 Difference]: Finished difference Result 590 states and 1573 transitions. [2020-10-20 02:57:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:57:51,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-20 02:57:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:51,993 INFO L225 Difference]: With dead ends: 590 [2020-10-20 02:57:51,993 INFO L226 Difference]: Without dead ends: 208 [2020-10-20 02:57:51,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-20 02:57:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2020-10-20 02:57:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-20 02:57:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-10-20 02:57:51,999 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 22 [2020-10-20 02:57:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:52,000 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-10-20 02:57:52,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:57:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-10-20 02:57:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:52,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:52,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:52,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 02:57:52,002 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1913086796, now seen corresponding path program 1 times [2020-10-20 02:57:52,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:52,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806163316] [2020-10-20 02:57:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:52,078 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:57:52,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806163316] [2020-10-20 02:57:52,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:52,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:57:52,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717479973] [2020-10-20 02:57:52,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:57:52,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:57:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:57:52,080 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states. [2020-10-20 02:57:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:52,104 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2020-10-20 02:57:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 02:57:52,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-20 02:57:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:52,106 INFO L225 Difference]: With dead ends: 234 [2020-10-20 02:57:52,106 INFO L226 Difference]: Without dead ends: 92 [2020-10-20 02:57:52,107 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:57:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-20 02:57:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-20 02:57:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-20 02:57:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-10-20 02:57:52,110 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-10-20 02:57:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:52,110 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-10-20 02:57:52,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:57:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-10-20 02:57:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:52,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:52,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:52,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 02:57:52,113 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1384911540, now seen corresponding path program 2 times [2020-10-20 02:57:52,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:52,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609801656] [2020-10-20 02:57:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:57:52,243 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:57:52,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609801656] [2020-10-20 02:57:52,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:57:52,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:57:52,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913024654] [2020-10-20 02:57:52,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:57:52,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:57:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:57:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:57:52,246 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 6 states. [2020-10-20 02:57:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:57:52,345 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2020-10-20 02:57:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:57:52,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-20 02:57:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:57:52,347 INFO L225 Difference]: With dead ends: 118 [2020-10-20 02:57:52,347 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 02:57:52,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:57:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 02:57:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-20 02:57:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 02:57:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-20 02:57:52,351 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-20 02:57:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:57:52,351 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-20 02:57:52,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:57:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-20 02:57:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:57:52,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:57:52,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:57:52,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 02:57:52,353 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:57:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:57:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1866539124, now seen corresponding path program 3 times [2020-10-20 02:57:52,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:57:52,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376550196] [2020-10-20 02:57:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:57:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:57:52,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:57:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:57:52,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:57:52,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:57:52,474 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:57:52,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 02:57:52,476 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 02:57:52,491 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L2-->L866: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-668193531 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-668193531 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-668193531 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-668193531 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In-668193531 ~z$r_buff1_thd0~0_Out-668193531) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531 0)) (or (and (= ~z$w_buff0_used~0_Out-668193531 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_In-668193531 ~z$w_buff0_used~0_Out-668193531) .cse2)) (= ~z$r_buff0_thd0~0_In-668193531 ~z$r_buff0_thd0~0_Out-668193531) (or (and (= ~z$w_buff1_used~0_Out-668193531 ~z$w_buff1_used~0_In-668193531) .cse3) (and (= ~z$w_buff1_used~0_Out-668193531 0) .cse4 .cse5)) (or (and (or (and (= ~z~0_Out-668193531 ~z$w_buff1~0_In-668193531) .cse4 .cse5) (and .cse3 (= ~z~0_Out-668193531 ~z~0_In-668193531))) .cse2) (and .cse0 .cse1 (= ~z~0_Out-668193531 ~z$w_buff0~0_In-668193531))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-668193531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668193531, ~z$w_buff0~0=~z$w_buff0~0_In-668193531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-668193531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668193531, ~z$w_buff1~0=~z$w_buff1~0_In-668193531, ~z~0=~z~0_In-668193531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-668193531, ~z$w_buff0~0=~z$w_buff0~0_In-668193531, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-668193531, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-668193531|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-668193531|, ~z$w_buff1~0=~z$w_buff1~0_In-668193531, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-668193531|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-668193531|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-668193531|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-668193531|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-668193531, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-668193531, ~z~0=~z~0_Out-668193531} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-20 02:57:52,499 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:57:52,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,500 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:57:52,500 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [803] [2020-10-20 02:57:52,502 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:57:52,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,503 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:57:52,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,503 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:57:52,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,504 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:57:52,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,504 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:57:52,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,505 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:57:52,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,506 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:57:52,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,506 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:57:52,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,507 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:57:52,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,507 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:57:52,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,535 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:57:52,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,536 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:57:52,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,536 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:57:52,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,537 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:57:52,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,537 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:57:52,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,537 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:57:52,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,538 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:57:52,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,538 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:57:52,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,540 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:57:52,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,541 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:57:52,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,541 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:57:52,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:57:52 BasicIcfg [2020-10-20 02:57:52,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:57:52,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:57:52,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:57:52,688 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:57:52,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:57:35" (3/4) ... [2020-10-20 02:57:52,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:57:52,704 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L2-->L866: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-668193531 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-668193531 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-668193531 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-668193531 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In-668193531 ~z$r_buff1_thd0~0_Out-668193531) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531 0)) (or (and (= ~z$w_buff0_used~0_Out-668193531 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_In-668193531 ~z$w_buff0_used~0_Out-668193531) .cse2)) (= ~z$r_buff0_thd0~0_In-668193531 ~z$r_buff0_thd0~0_Out-668193531) (or (and (= ~z$w_buff1_used~0_Out-668193531 ~z$w_buff1_used~0_In-668193531) .cse3) (and (= ~z$w_buff1_used~0_Out-668193531 0) .cse4 .cse5)) (or (and (or (and (= ~z~0_Out-668193531 ~z$w_buff1~0_In-668193531) .cse4 .cse5) (and .cse3 (= ~z~0_Out-668193531 ~z~0_In-668193531))) .cse2) (and .cse0 .cse1 (= ~z~0_Out-668193531 ~z$w_buff0~0_In-668193531))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-668193531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668193531, ~z$w_buff0~0=~z$w_buff0~0_In-668193531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-668193531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668193531, ~z$w_buff1~0=~z$w_buff1~0_In-668193531, ~z~0=~z~0_In-668193531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-668193531, ~z$w_buff0~0=~z$w_buff0~0_In-668193531, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-668193531, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-668193531|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-668193531|, ~z$w_buff1~0=~z$w_buff1~0_In-668193531, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-668193531|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-668193531|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-668193531|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-668193531|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-668193531|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-668193531, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-668193531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-668193531, ~z~0=~z~0_Out-668193531} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-20 02:57:52,706 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:57:52,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,706 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:57:52,706 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [803] [2020-10-20 02:57:52,707 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:57:52,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,707 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:57:52,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,708 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:57:52,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,708 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:57:52,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,708 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:57:52,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,709 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:57:52,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,709 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:57:52,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,710 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:57:52,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,710 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:57:52,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,710 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:57:52,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,711 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:57:52,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,711 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:57:52,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,712 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:57:52,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,712 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:57:52,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,712 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:57:52,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,713 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:57:52,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,713 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:57:52,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,713 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:57:52,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,714 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:57:52,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,714 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:57:52,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,714 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:57:52,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:57:52,867 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:57:52,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:57:52,869 INFO L168 Benchmark]: Toolchain (without parser) took 20895.35 ms. Allocated memory was 41.9 MB in the beginning and 182.5 MB in the end (delta: 140.5 MB). Free memory was 20.5 MB in the beginning and 92.5 MB in the end (delta: -72.0 MB). Peak memory consumption was 68.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,869 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 32.0 MB. Free memory was 10.8 MB in the beginning and 10.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.90 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 19.6 MB in the beginning and 10.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.90 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 10.3 MB in the beginning and 26.8 MB in the end (delta: -16.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,870 INFO L168 Benchmark]: Boogie Preprocessor took 41.49 ms. Allocated memory is still 44.6 MB. Free memory was 26.8 MB in the beginning and 24.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,871 INFO L168 Benchmark]: RCFGBuilder took 2271.30 ms. Allocated memory was 44.6 MB in the beginning and 63.4 MB in the end (delta: 18.9 MB). Free memory was 24.3 MB in the beginning and 27.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,871 INFO L168 Benchmark]: TraceAbstraction took 17607.70 ms. Allocated memory was 63.4 MB in the beginning and 182.5 MB in the end (delta: 119.0 MB). Free memory was 26.6 MB in the beginning and 114.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 118.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,872 INFO L168 Benchmark]: Witness Printer took 179.88 ms. Allocated memory is still 182.5 MB. Free memory was 114.9 MB in the beginning and 92.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:57:52,876 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 32.0 MB. Free memory was 10.8 MB in the beginning and 10.7 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 706.90 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 19.6 MB in the beginning and 10.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 77.90 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 10.3 MB in the beginning and 26.8 MB in the end (delta: -16.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.49 ms. Allocated memory is still 44.6 MB. Free memory was 26.8 MB in the beginning and 24.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2271.30 ms. Allocated memory was 44.6 MB in the beginning and 63.4 MB in the end (delta: 18.9 MB). Free memory was 24.3 MB in the beginning and 27.2 MB in the end (delta: -2.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17607.70 ms. Allocated memory was 63.4 MB in the beginning and 182.5 MB in the end (delta: 119.0 MB). Free memory was 26.6 MB in the beginning and 114.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 118.1 MB. Max. memory is 14.3 GB. * Witness Printer took 179.88 ms. Allocated memory is still 182.5 MB. Free memory was 114.9 MB in the beginning and 92.5 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1897 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 65 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.8s, 132 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 6354 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1141; [L849] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1142; [L851] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1143; [L853] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1144; [L855] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix043_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix043_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.2s, HoareTripleCheckerStatistics: 419 SDtfs, 487 SDslu, 707 SDs, 0 SdLazy, 269 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 167 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 19307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...