./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a68dfdc5231f91ed72bde1129b01e1dc58aa71eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-f470102 [2019-12-07 12:58:35,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:58:35,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:58:35,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:58:35,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:58:35,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:58:35,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:58:35,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:58:35,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:58:35,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:58:35,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:58:35,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:58:35,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:58:35,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:58:35,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:58:35,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:58:35,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:58:35,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:58:35,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:58:35,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:58:35,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:58:35,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:58:35,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:58:35,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:58:35,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:58:35,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:58:35,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:58:35,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:58:35,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:58:35,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:58:35,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:58:35,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:58:35,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:58:35,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:58:35,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:58:35,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:58:35,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:58:35,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:58:35,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:58:35,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:58:35,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:58:35,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:58:35,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:58:35,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:58:35,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:58:35,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:58:35,777 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:58:35,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:58:35,777 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:58:35,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:58:35,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:58:35,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:58:35,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:58:35,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:58:35,780 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer 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(__VERIFIER_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 -> a68dfdc5231f91ed72bde1129b01e1dc58aa71eb [2019-12-07 12:58:35,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:58:35,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:58:35,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:58:35,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:58:35,891 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:58:35,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i [2019-12-07 12:58:35,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/data/850b2e4e3/2f069ca1a3184f22848dbcf89f278046/FLAG323d3bceb [2019-12-07 12:58:36,289 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:58:36,289 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/sv-benchmarks/c/pthread-wmm/mix052_tso.opt.i [2019-12-07 12:58:36,300 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/data/850b2e4e3/2f069ca1a3184f22848dbcf89f278046/FLAG323d3bceb [2019-12-07 12:58:36,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/data/850b2e4e3/2f069ca1a3184f22848dbcf89f278046 [2019-12-07 12:58:36,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:58:36,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:58:36,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:36,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:58:36,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:58:36,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36, skipping insertion in model container [2019-12-07 12:58:36,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:58:36,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:58:36,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:36,599 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:58:36,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:58:36,688 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:58:36,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36 WrapperNode [2019-12-07 12:58:36,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:58:36,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:36,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:58:36,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:58:36,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:58:36,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:58:36,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:58:36,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:58:36,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... [2019-12-07 12:58:36,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:58:36,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:58:36,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:58:36,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:58:36,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/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 [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:58:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:58:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:58:36,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:58:36,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:58:36,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:58:36,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:58:36,797 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:58:37,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:58:37,133 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:58:37,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:37 BoogieIcfgContainer [2019-12-07 12:58:37,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:58:37,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:58:37,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:58:37,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:58:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:58:36" (1/3) ... [2019-12-07 12:58:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b64dda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:37, skipping insertion in model container [2019-12-07 12:58:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:58:36" (2/3) ... [2019-12-07 12:58:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b64dda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:58:37, skipping insertion in model container [2019-12-07 12:58:37,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:37" (3/3) ... [2019-12-07 12:58:37,139 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.opt.i [2019-12-07 12:58:37,145 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:58:37,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:58:37,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:58:37,150 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:58:37,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:58:37,209 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:58:37,221 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:58:37,221 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:58:37,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:58:37,221 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:58:37,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:58:37,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:58:37,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:58:37,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:58:37,231 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 12:58:37,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 12:58:37,279 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 12:58:37,279 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:58:37,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:58:37,299 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 12:58:37,322 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 12:58:37,322 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:58:37,326 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:58:37,336 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 12:58:37,336 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:58:39,873 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 12:58:39,988 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-12-07 12:58:39,988 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 12:58:39,991 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-12-07 12:58:40,538 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-12-07 12:58:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-12-07 12:58:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:58:40,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:40,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:40,545 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:40,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-12-07 12:58:40,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:40,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144588370] [2019-12-07 12:58:40,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:40,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144588370] [2019-12-07 12:58:40,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:40,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:58:40,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509085791] [2019-12-07 12:58:40,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:40,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:40,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:40,715 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-12-07 12:58:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:40,914 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-12-07 12:58:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:40,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:58:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:41,006 INFO L225 Difference]: With dead ends: 12374 [2019-12-07 12:58:41,006 INFO L226 Difference]: Without dead ends: 11654 [2019-12-07 12:58:41,007 INFO L630 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 [2019-12-07 12:58:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-12-07 12:58:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-12-07 12:58:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-12-07 12:58:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-12-07 12:58:41,430 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-12-07 12:58:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:41,431 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-12-07 12:58:41,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-12-07 12:58:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:58:41,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:41,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:41,435 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-12-07 12:58:41,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:41,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348834134] [2019-12-07 12:58:41,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:41,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348834134] [2019-12-07 12:58:41,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:41,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:41,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276280231] [2019-12-07 12:58:41,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:41,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:41,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:41,503 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 4 states. [2019-12-07 12:58:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:41,750 INFO L93 Difference]: Finished difference Result 17566 states and 64596 transitions. [2019-12-07 12:58:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:58:41,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:58:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:41,805 INFO L225 Difference]: With dead ends: 17566 [2019-12-07 12:58:41,805 INFO L226 Difference]: Without dead ends: 17538 [2019-12-07 12:58:41,806 INFO L630 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 [2019-12-07 12:58:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17538 states. [2019-12-07 12:58:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17538 to 15872. [2019-12-07 12:58:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15872 states. [2019-12-07 12:58:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15872 states to 15872 states and 59183 transitions. [2019-12-07 12:58:42,249 INFO L78 Accepts]: Start accepts. Automaton has 15872 states and 59183 transitions. Word has length 13 [2019-12-07 12:58:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:42,249 INFO L462 AbstractCegarLoop]: Abstraction has 15872 states and 59183 transitions. [2019-12-07 12:58:42,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15872 states and 59183 transitions. [2019-12-07 12:58:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:58:42,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:42,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:42,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-12-07 12:58:42,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:42,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421928410] [2019-12-07 12:58:42,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:42,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421928410] [2019-12-07 12:58:42,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:42,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:42,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850977456] [2019-12-07 12:58:42,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:42,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:42,303 INFO L87 Difference]: Start difference. First operand 15872 states and 59183 transitions. Second operand 4 states. [2019-12-07 12:58:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:42,466 INFO L93 Difference]: Finished difference Result 20884 states and 77167 transitions. [2019-12-07 12:58:42,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:58:42,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:58:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:42,504 INFO L225 Difference]: With dead ends: 20884 [2019-12-07 12:58:42,504 INFO L226 Difference]: Without dead ends: 20858 [2019-12-07 12:58:42,504 INFO L630 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 [2019-12-07 12:58:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2019-12-07 12:58:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 18074. [2019-12-07 12:58:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18074 states. [2019-12-07 12:58:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18074 states to 18074 states and 67346 transitions. [2019-12-07 12:58:42,931 INFO L78 Accepts]: Start accepts. Automaton has 18074 states and 67346 transitions. Word has length 16 [2019-12-07 12:58:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:42,932 INFO L462 AbstractCegarLoop]: Abstraction has 18074 states and 67346 transitions. [2019-12-07 12:58:42,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18074 states and 67346 transitions. [2019-12-07 12:58:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:58:42,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:42,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:42,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-12-07 12:58:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812680745] [2019-12-07 12:58:42,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:42,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812680745] [2019-12-07 12:58:42,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:42,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:42,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502587099] [2019-12-07 12:58:42,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:42,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:42,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:42,973 INFO L87 Difference]: Start difference. First operand 18074 states and 67346 transitions. Second operand 4 states. [2019-12-07 12:58:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:43,138 INFO L93 Difference]: Finished difference Result 22456 states and 83013 transitions. [2019-12-07 12:58:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:58:43,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:58:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:43,174 INFO L225 Difference]: With dead ends: 22456 [2019-12-07 12:58:43,175 INFO L226 Difference]: Without dead ends: 22430 [2019-12-07 12:58:43,175 INFO L630 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 [2019-12-07 12:58:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2019-12-07 12:58:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 17846. [2019-12-07 12:58:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17846 states. [2019-12-07 12:58:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17846 states to 17846 states and 66430 transitions. [2019-12-07 12:58:43,539 INFO L78 Accepts]: Start accepts. Automaton has 17846 states and 66430 transitions. Word has length 16 [2019-12-07 12:58:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:43,539 INFO L462 AbstractCegarLoop]: Abstraction has 17846 states and 66430 transitions. [2019-12-07 12:58:43,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17846 states and 66430 transitions. [2019-12-07 12:58:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:58:43,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:43,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:43,544 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash -478811358, now seen corresponding path program 1 times [2019-12-07 12:58:43,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:43,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164139076] [2019-12-07 12:58:43,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:43,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164139076] [2019-12-07 12:58:43,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:43,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:58:43,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195585379] [2019-12-07 12:58:43,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:43,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:43,594 INFO L87 Difference]: Start difference. First operand 17846 states and 66430 transitions. Second operand 3 states. [2019-12-07 12:58:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:43,695 INFO L93 Difference]: Finished difference Result 26759 states and 94453 transitions. [2019-12-07 12:58:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:43,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:58:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:43,745 INFO L225 Difference]: With dead ends: 26759 [2019-12-07 12:58:43,745 INFO L226 Difference]: Without dead ends: 26047 [2019-12-07 12:58:43,746 INFO L630 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 [2019-12-07 12:58:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26047 states. [2019-12-07 12:58:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26047 to 25276. [2019-12-07 12:58:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25276 states. [2019-12-07 12:58:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25276 states to 25276 states and 89896 transitions. [2019-12-07 12:58:44,271 INFO L78 Accepts]: Start accepts. Automaton has 25276 states and 89896 transitions. Word has length 18 [2019-12-07 12:58:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:44,271 INFO L462 AbstractCegarLoop]: Abstraction has 25276 states and 89896 transitions. [2019-12-07 12:58:44,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25276 states and 89896 transitions. [2019-12-07 12:58:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:58:44,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:44,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:44,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 196741826, now seen corresponding path program 1 times [2019-12-07 12:58:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:44,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986245310] [2019-12-07 12:58:44,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:44,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986245310] [2019-12-07 12:58:44,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:44,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:44,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84832016] [2019-12-07 12:58:44,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:44,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:44,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:44,326 INFO L87 Difference]: Start difference. First operand 25276 states and 89896 transitions. Second operand 4 states. [2019-12-07 12:58:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:44,420 INFO L93 Difference]: Finished difference Result 26003 states and 91483 transitions. [2019-12-07 12:58:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:44,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 12:58:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:44,464 INFO L225 Difference]: With dead ends: 26003 [2019-12-07 12:58:44,464 INFO L226 Difference]: Without dead ends: 26003 [2019-12-07 12:58:44,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26003 states. [2019-12-07 12:58:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26003 to 25254. [2019-12-07 12:58:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25254 states. [2019-12-07 12:58:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25254 states to 25254 states and 89809 transitions. [2019-12-07 12:58:44,994 INFO L78 Accepts]: Start accepts. Automaton has 25254 states and 89809 transitions. Word has length 19 [2019-12-07 12:58:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:44,994 INFO L462 AbstractCegarLoop]: Abstraction has 25254 states and 89809 transitions. [2019-12-07 12:58:44,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25254 states and 89809 transitions. [2019-12-07 12:58:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:58:45,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:45,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:45,000 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1662641865, now seen corresponding path program 1 times [2019-12-07 12:58:45,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:45,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37736097] [2019-12-07 12:58:45,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:45,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37736097] [2019-12-07 12:58:45,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:45,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:45,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930973462] [2019-12-07 12:58:45,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:45,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:45,030 INFO L87 Difference]: Start difference. First operand 25254 states and 89809 transitions. Second operand 3 states. [2019-12-07 12:58:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:45,089 INFO L93 Difference]: Finished difference Result 16448 states and 53466 transitions. [2019-12-07 12:58:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:45,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:58:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:45,112 INFO L225 Difference]: With dead ends: 16448 [2019-12-07 12:58:45,112 INFO L226 Difference]: Without dead ends: 16448 [2019-12-07 12:58:45,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2019-12-07 12:58:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 16448. [2019-12-07 12:58:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-12-07 12:58:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 53466 transitions. [2019-12-07 12:58:45,336 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 53466 transitions. Word has length 19 [2019-12-07 12:58:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:45,337 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 53466 transitions. [2019-12-07 12:58:45,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 53466 transitions. [2019-12-07 12:58:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:58:45,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:45,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:45,341 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1453141009, now seen corresponding path program 1 times [2019-12-07 12:58:45,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:45,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198437909] [2019-12-07 12:58:45,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:45,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198437909] [2019-12-07 12:58:45,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:45,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:45,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126312062] [2019-12-07 12:58:45,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:45,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:45,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:45,371 INFO L87 Difference]: Start difference. First operand 16448 states and 53466 transitions. Second operand 4 states. [2019-12-07 12:58:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:45,457 INFO L93 Difference]: Finished difference Result 20958 states and 68035 transitions. [2019-12-07 12:58:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:45,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 12:58:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:45,477 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 12:58:45,477 INFO L226 Difference]: Without dead ends: 13936 [2019-12-07 12:58:45,477 INFO L630 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 [2019-12-07 12:58:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13936 states. [2019-12-07 12:58:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13936 to 13527. [2019-12-07 12:58:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13527 states. [2019-12-07 12:58:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13527 states to 13527 states and 42958 transitions. [2019-12-07 12:58:45,733 INFO L78 Accepts]: Start accepts. Automaton has 13527 states and 42958 transitions. Word has length 20 [2019-12-07 12:58:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:45,733 INFO L462 AbstractCegarLoop]: Abstraction has 13527 states and 42958 transitions. [2019-12-07 12:58:45,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13527 states and 42958 transitions. [2019-12-07 12:58:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:58:45,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:45,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:45,737 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash 982442596, now seen corresponding path program 1 times [2019-12-07 12:58:45,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94819931] [2019-12-07 12:58:45,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:45,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94819931] [2019-12-07 12:58:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:45,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924993662] [2019-12-07 12:58:45,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:45,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:45,764 INFO L87 Difference]: Start difference. First operand 13527 states and 42958 transitions. Second operand 4 states. [2019-12-07 12:58:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:45,786 INFO L93 Difference]: Finished difference Result 2778 states and 6971 transitions. [2019-12-07 12:58:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:45,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 12:58:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:45,789 INFO L225 Difference]: With dead ends: 2778 [2019-12-07 12:58:45,790 INFO L226 Difference]: Without dead ends: 2778 [2019-12-07 12:58:45,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-07 12:58:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2676. [2019-12-07 12:58:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-12-07 12:58:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 6777 transitions. [2019-12-07 12:58:45,819 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 6777 transitions. Word has length 20 [2019-12-07 12:58:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:45,819 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 6777 transitions. [2019-12-07 12:58:45,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 6777 transitions. [2019-12-07 12:58:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:58:45,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:45,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:45,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-12-07 12:58:45,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:45,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001871110] [2019-12-07 12:58:45,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:45,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001871110] [2019-12-07 12:58:45,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:45,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:45,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171022924] [2019-12-07 12:58:45,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:45,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:45,843 INFO L87 Difference]: Start difference. First operand 2676 states and 6777 transitions. Second operand 3 states. [2019-12-07 12:58:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:45,873 INFO L93 Difference]: Finished difference Result 3670 states and 9048 transitions. [2019-12-07 12:58:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:45,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:58:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:45,877 INFO L225 Difference]: With dead ends: 3670 [2019-12-07 12:58:45,877 INFO L226 Difference]: Without dead ends: 3670 [2019-12-07 12:58:45,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-07 12:58:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 2927. [2019-12-07 12:58:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2019-12-07 12:58:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 7359 transitions. [2019-12-07 12:58:45,904 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 7359 transitions. Word has length 29 [2019-12-07 12:58:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:45,904 INFO L462 AbstractCegarLoop]: Abstraction has 2927 states and 7359 transitions. [2019-12-07 12:58:45,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 7359 transitions. [2019-12-07 12:58:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:58:45,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:45,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:45,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:45,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-12-07 12:58:45,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:45,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611831256] [2019-12-07 12:58:45,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:45,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611831256] [2019-12-07 12:58:45,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:45,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:45,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431127528] [2019-12-07 12:58:45,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:45,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:45,944 INFO L87 Difference]: Start difference. First operand 2927 states and 7359 transitions. Second operand 5 states. [2019-12-07 12:58:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:46,059 INFO L93 Difference]: Finished difference Result 3660 states and 8972 transitions. [2019-12-07 12:58:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:58:46,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 12:58:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:46,062 INFO L225 Difference]: With dead ends: 3660 [2019-12-07 12:58:46,063 INFO L226 Difference]: Without dead ends: 3624 [2019-12-07 12:58:46,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:58:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2019-12-07 12:58:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3071. [2019-12-07 12:58:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-12-07 12:58:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 7673 transitions. [2019-12-07 12:58:46,090 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 7673 transitions. Word has length 29 [2019-12-07 12:58:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:46,090 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 7673 transitions. [2019-12-07 12:58:46,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 7673 transitions. [2019-12-07 12:58:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:58:46,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:46,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:46,093 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1335383201, now seen corresponding path program 1 times [2019-12-07 12:58:46,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:46,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933282947] [2019-12-07 12:58:46,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933282947] [2019-12-07 12:58:46,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:46,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:46,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975524087] [2019-12-07 12:58:46,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:46,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:46,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:46,116 INFO L87 Difference]: Start difference. First operand 3071 states and 7673 transitions. Second operand 3 states. [2019-12-07 12:58:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:46,148 INFO L93 Difference]: Finished difference Result 3767 states and 9084 transitions. [2019-12-07 12:58:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:46,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:58:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:46,151 INFO L225 Difference]: With dead ends: 3767 [2019-12-07 12:58:46,151 INFO L226 Difference]: Without dead ends: 3767 [2019-12-07 12:58:46,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2019-12-07 12:58:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3211. [2019-12-07 12:58:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3211 states. [2019-12-07 12:58:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 7790 transitions. [2019-12-07 12:58:46,178 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 7790 transitions. Word has length 29 [2019-12-07 12:58:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:46,179 INFO L462 AbstractCegarLoop]: Abstraction has 3211 states and 7790 transitions. [2019-12-07 12:58:46,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 7790 transitions. [2019-12-07 12:58:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:58:46,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:46,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:46,181 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -569769579, now seen corresponding path program 1 times [2019-12-07 12:58:46,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:46,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440237766] [2019-12-07 12:58:46,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:46,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440237766] [2019-12-07 12:58:46,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:46,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:58:46,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407346424] [2019-12-07 12:58:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:46,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:46,239 INFO L87 Difference]: Start difference. First operand 3211 states and 7790 transitions. Second operand 5 states. [2019-12-07 12:58:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:46,464 INFO L93 Difference]: Finished difference Result 4850 states and 11590 transitions. [2019-12-07 12:58:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:46,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 12:58:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:46,468 INFO L225 Difference]: With dead ends: 4850 [2019-12-07 12:58:46,468 INFO L226 Difference]: Without dead ends: 4850 [2019-12-07 12:58:46,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2019-12-07 12:58:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4234. [2019-12-07 12:58:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-07 12:58:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 10191 transitions. [2019-12-07 12:58:46,507 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 10191 transitions. Word has length 30 [2019-12-07 12:58:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:46,507 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 10191 transitions. [2019-12-07 12:58:46,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 10191 transitions. [2019-12-07 12:58:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:58:46,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:46,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:46,511 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1073342184, now seen corresponding path program 1 times [2019-12-07 12:58:46,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:46,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361541862] [2019-12-07 12:58:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:46,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361541862] [2019-12-07 12:58:46,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571424190] [2019-12-07 12:58:46,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:46,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:46,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:46,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:46,553 INFO L87 Difference]: Start difference. First operand 4234 states and 10191 transitions. Second operand 5 states. [2019-12-07 12:58:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:46,680 INFO L93 Difference]: Finished difference Result 4795 states and 11415 transitions. [2019-12-07 12:58:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:58:46,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 12:58:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:46,684 INFO L225 Difference]: With dead ends: 4795 [2019-12-07 12:58:46,684 INFO L226 Difference]: Without dead ends: 4759 [2019-12-07 12:58:46,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:58:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2019-12-07 12:58:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 4187. [2019-12-07 12:58:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-12-07 12:58:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 10096 transitions. [2019-12-07 12:58:46,721 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 10096 transitions. Word has length 30 [2019-12-07 12:58:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:46,721 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 10096 transitions. [2019-12-07 12:58:46,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 10096 transitions. [2019-12-07 12:58:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:58:46,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:46,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:46,725 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1052270197, now seen corresponding path program 1 times [2019-12-07 12:58:46,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595335143] [2019-12-07 12:58:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:46,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595335143] [2019-12-07 12:58:46,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:46,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:58:46,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398501610] [2019-12-07 12:58:46,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:58:46,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:58:46,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:46,753 INFO L87 Difference]: Start difference. First operand 4187 states and 10096 transitions. Second operand 5 states. [2019-12-07 12:58:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:46,774 INFO L93 Difference]: Finished difference Result 2650 states and 6420 transitions. [2019-12-07 12:58:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:58:46,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 12:58:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:46,777 INFO L225 Difference]: With dead ends: 2650 [2019-12-07 12:58:46,777 INFO L226 Difference]: Without dead ends: 2416 [2019-12-07 12:58:46,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:58:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2019-12-07 12:58:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1596. [2019-12-07 12:58:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-12-07 12:58:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4005 transitions. [2019-12-07 12:58:46,794 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 4005 transitions. Word has length 31 [2019-12-07 12:58:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:46,795 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 4005 transitions. [2019-12-07 12:58:46,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:58:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 4005 transitions. [2019-12-07 12:58:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:58:46,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:46,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:46,797 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash -622647523, now seen corresponding path program 1 times [2019-12-07 12:58:46,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:46,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166872478] [2019-12-07 12:58:46,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:46,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166872478] [2019-12-07 12:58:46,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:46,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:58:46,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408898395] [2019-12-07 12:58:46,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:46,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:46,843 INFO L87 Difference]: Start difference. First operand 1596 states and 4005 transitions. Second operand 6 states. [2019-12-07 12:58:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:47,106 INFO L93 Difference]: Finished difference Result 1978 states and 4853 transitions. [2019-12-07 12:58:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:58:47,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 12:58:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:47,108 INFO L225 Difference]: With dead ends: 1978 [2019-12-07 12:58:47,108 INFO L226 Difference]: Without dead ends: 1978 [2019-12-07 12:58:47,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:58:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-12-07 12:58:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1614. [2019-12-07 12:58:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2019-12-07 12:58:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 4045 transitions. [2019-12-07 12:58:47,123 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 4045 transitions. Word has length 44 [2019-12-07 12:58:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:47,123 INFO L462 AbstractCegarLoop]: Abstraction has 1614 states and 4045 transitions. [2019-12-07 12:58:47,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 4045 transitions. [2019-12-07 12:58:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:58:47,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:47,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:47,125 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1587431775, now seen corresponding path program 2 times [2019-12-07 12:58:47,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:47,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406996149] [2019-12-07 12:58:47,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:47,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406996149] [2019-12-07 12:58:47,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:47,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:58:47,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376068651] [2019-12-07 12:58:47,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:58:47,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:58:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:58:47,229 INFO L87 Difference]: Start difference. First operand 1614 states and 4045 transitions. Second operand 10 states. [2019-12-07 12:58:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:48,317 INFO L93 Difference]: Finished difference Result 5932 states and 14423 transitions. [2019-12-07 12:58:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 12:58:48,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-12-07 12:58:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:48,321 INFO L225 Difference]: With dead ends: 5932 [2019-12-07 12:58:48,321 INFO L226 Difference]: Without dead ends: 5756 [2019-12-07 12:58:48,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:58:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-12-07 12:58:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 2182. [2019-12-07 12:58:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-12-07 12:58:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5550 transitions. [2019-12-07 12:58:48,353 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5550 transitions. Word has length 44 [2019-12-07 12:58:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:48,353 INFO L462 AbstractCegarLoop]: Abstraction has 2182 states and 5550 transitions. [2019-12-07 12:58:48,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:58:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5550 transitions. [2019-12-07 12:58:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:58:48,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:48,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:48,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1098186797, now seen corresponding path program 3 times [2019-12-07 12:58:48,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:48,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996289377] [2019-12-07 12:58:48,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:48,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996289377] [2019-12-07 12:58:48,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:48,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:58:48,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237953858] [2019-12-07 12:58:48,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:48,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:48,395 INFO L87 Difference]: Start difference. First operand 2182 states and 5550 transitions. Second operand 4 states. [2019-12-07 12:58:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:48,411 INFO L93 Difference]: Finished difference Result 3110 states and 7515 transitions. [2019-12-07 12:58:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:48,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 12:58:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:48,413 INFO L225 Difference]: With dead ends: 3110 [2019-12-07 12:58:48,413 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 12:58:48,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 12:58:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2019-12-07 12:58:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-12-07 12:58:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2054 transitions. [2019-12-07 12:58:48,420 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2054 transitions. Word has length 44 [2019-12-07 12:58:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:48,420 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 2054 transitions. [2019-12-07 12:58:48,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2054 transitions. [2019-12-07 12:58:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:58:48,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:48,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:48,422 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1297782901, now seen corresponding path program 4 times [2019-12-07 12:58:48,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:48,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207294475] [2019-12-07 12:58:48,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:48,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207294475] [2019-12-07 12:58:48,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:48,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:58:48,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568883442] [2019-12-07 12:58:48,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:58:48,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:58:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:58:48,474 INFO L87 Difference]: Start difference. First operand 978 states and 2054 transitions. Second operand 7 states. [2019-12-07 12:58:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:48,609 INFO L93 Difference]: Finished difference Result 1201 states and 2445 transitions. [2019-12-07 12:58:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:58:48,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-07 12:58:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:48,610 INFO L225 Difference]: With dead ends: 1201 [2019-12-07 12:58:48,611 INFO L226 Difference]: Without dead ends: 814 [2019-12-07 12:58:48,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:58:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-07 12:58:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 770. [2019-12-07 12:58:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-07 12:58:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1596 transitions. [2019-12-07 12:58:48,617 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1596 transitions. Word has length 44 [2019-12-07 12:58:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:48,617 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1596 transitions. [2019-12-07 12:58:48,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:58:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1596 transitions. [2019-12-07 12:58:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:58:48,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:48,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:48,618 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 191693083, now seen corresponding path program 5 times [2019-12-07 12:58:48,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:48,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656005295] [2019-12-07 12:58:48,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:58:48,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656005295] [2019-12-07 12:58:48,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:48,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:58:48,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181543517] [2019-12-07 12:58:48,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:48,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:48,656 INFO L87 Difference]: Start difference. First operand 770 states and 1596 transitions. Second operand 3 states. [2019-12-07 12:58:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:48,665 INFO L93 Difference]: Finished difference Result 768 states and 1591 transitions. [2019-12-07 12:58:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:48,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 12:58:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:48,666 INFO L225 Difference]: With dead ends: 768 [2019-12-07 12:58:48,666 INFO L226 Difference]: Without dead ends: 768 [2019-12-07 12:58:48,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-07 12:58:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 658. [2019-12-07 12:58:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 12:58:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1382 transitions. [2019-12-07 12:58:48,672 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1382 transitions. Word has length 44 [2019-12-07 12:58:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:48,672 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1382 transitions. [2019-12-07 12:58:48,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1382 transitions. [2019-12-07 12:58:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:58:48,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:48,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:48,673 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 1 times [2019-12-07 12:58:48,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:48,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113946644] [2019-12-07 12:58:48,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:58:48,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:58:48,740 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:58:48,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= 0 |v_ULTIMATE.start_main_~#t1406~0.offset_23|) (= v_~y$mem_tmp~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1406~0.base_31| 4)) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31|) |v_ULTIMATE.start_main_~#t1406~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31| 1) |v_#valid_62|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1406~0.base_31|) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1406~0.base=|v_ULTIMATE.start_main_~#t1406~0.base_31|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1406~0.offset=|v_ULTIMATE.start_main_~#t1406~0.offset_23|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1406~0.base, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ULTIMATE.start_main_~#t1407~0.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1408~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1408~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t1406~0.offset, ULTIMATE.start_main_~#t1407~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:58:48,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1407~0.base_9| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1407~0.base_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1407~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9|) |v_ULTIMATE.start_main_~#t1407~0.offset_9| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1407~0.offset, #length, ULTIMATE.start_main_~#t1407~0.base] because there is no mapped edge [2019-12-07 12:58:48,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1408~0.base_10| 4)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1408~0.base_10|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t1408~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10|) |v_ULTIMATE.start_main_~#t1408~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1408~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1408~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1408~0.offset, #length] because there is no mapped edge [2019-12-07 12:58:48,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:58:48,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:58:48,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-607850233 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-607850233 |P1Thread1of1ForFork1_#t~ite9_Out-607850233|) (= |P1Thread1of1ForFork1_#t~ite8_In-607850233| |P1Thread1of1ForFork1_#t~ite8_Out-607850233|)) (and (= ~y$w_buff0~0_In-607850233 |P1Thread1of1ForFork1_#t~ite8_Out-607850233|) (= |P1Thread1of1ForFork1_#t~ite8_Out-607850233| |P1Thread1of1ForFork1_#t~ite9_Out-607850233|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-607850233 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-607850233 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-607850233 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-607850233 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-607850233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$w_buff0~0=~y$w_buff0~0_In-607850233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607850233, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-607850233|, ~weak$$choice2~0=~weak$$choice2~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-607850233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-607850233|, ~y$w_buff0~0=~y$w_buff0~0_In-607850233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607850233, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-607850233|, ~weak$$choice2~0=~weak$$choice2~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:58:48,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1397961587 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-1397961587| |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (= ~y$w_buff1~0_In-1397961587 |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1397961587 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1397961587 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1397961587 256))) (= 0 (mod ~y$w_buff0_used~0_In-1397961587 256))))) (and (= ~y$w_buff1~0_In-1397961587 |P1Thread1of1ForFork1_#t~ite12_Out-1397961587|) (= |P1Thread1of1ForFork1_#t~ite11_In-1397961587| |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397961587, ~y$w_buff1~0=~y$w_buff1~0_In-1397961587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397961587, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397961587, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-1397961587|, ~weak$$choice2~0=~weak$$choice2~0_In-1397961587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397961587} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397961587, ~y$w_buff1~0=~y$w_buff1~0_In-1397961587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397961587, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397961587, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1397961587|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1397961587|, ~weak$$choice2~0=~weak$$choice2~0_In-1397961587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397961587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:58:48,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:58:48,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:58:48,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-592809762 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-592809762 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-592809762| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-592809762| ~y$w_buff0_used~0_In-592809762)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-592809762} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-592809762, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-592809762|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:58:48,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1813257112 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1813257112 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1813257112 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1813257112 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1813257112| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1813257112 |P2Thread1of1ForFork2_#t~ite29_Out-1813257112|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1813257112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1813257112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1813257112} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1813257112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1813257112, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1813257112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1813257112} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:58:48,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In115148202 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In115148202 ~y$r_buff0_thd3~0_Out115148202)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In115148202 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out115148202)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In115148202, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In115148202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In115148202, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out115148202|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out115148202} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:58:48,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2131040669 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2131040669 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2131040669 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2131040669 256)))) (or (and (= ~y$r_buff1_thd3~0_In-2131040669 |P2Thread1of1ForFork2_#t~ite31_Out-2131040669|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-2131040669|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2131040669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131040669, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2131040669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131040669} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2131040669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131040669, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2131040669|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2131040669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131040669} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:58:48,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:58:48,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:58:48,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In2063095556 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2063095556 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2063095556| ~y$w_buff1~0_In2063095556)) (and (= |ULTIMATE.start_main_#t~ite35_Out2063095556| ~y~0_In2063095556) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2063095556, ~y~0=~y~0_In2063095556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063095556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063095556} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2063095556, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2063095556|, ~y~0=~y~0_In2063095556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063095556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063095556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:58:48,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:58:48,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In220878207 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In220878207 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out220878207| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In220878207 |ULTIMATE.start_main_#t~ite37_Out220878207|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In220878207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In220878207} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In220878207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In220878207, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out220878207|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:58:48,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In974177362 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In974177362 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In974177362 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In974177362 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In974177362 |ULTIMATE.start_main_#t~ite38_Out974177362|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out974177362| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974177362, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974177362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974177362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974177362, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out974177362|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974177362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974177362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:58:48,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In181318979 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In181318979 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out181318979| ~y$r_buff0_thd0~0_In181318979) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out181318979| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In181318979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181318979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In181318979, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out181318979|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181318979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:58:48,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1090179666 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1090179666 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1090179666 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1090179666 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1090179666| ~y$r_buff1_thd0~0_In1090179666) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1090179666|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1090179666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1090179666, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1090179666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1090179666} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1090179666|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1090179666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1090179666, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1090179666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1090179666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:58:48,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:58:48,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:58:48 BasicIcfg [2019-12-07 12:58:48,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:58:48,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:58:48,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:58:48,809 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:58:48,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:58:37" (3/4) ... [2019-12-07 12:58:48,811 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:58:48,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= 0 |v_ULTIMATE.start_main_~#t1406~0.offset_23|) (= v_~y$mem_tmp~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1406~0.base_31| 4)) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31|) |v_ULTIMATE.start_main_~#t1406~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31| 1) |v_#valid_62|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1406~0.base_31|) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1406~0.base=|v_ULTIMATE.start_main_~#t1406~0.base_31|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1406~0.offset=|v_ULTIMATE.start_main_~#t1406~0.offset_23|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1406~0.base, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ULTIMATE.start_main_~#t1407~0.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1408~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1408~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t1406~0.offset, ULTIMATE.start_main_~#t1407~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:58:48,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1407~0.base_9| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1407~0.base_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1407~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9|) |v_ULTIMATE.start_main_~#t1407~0.offset_9| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1407~0.offset, #length, ULTIMATE.start_main_~#t1407~0.base] because there is no mapped edge [2019-12-07 12:58:48,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1408~0.base_10| 4)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1408~0.base_10|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t1408~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10|) |v_ULTIMATE.start_main_~#t1408~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1408~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1408~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1408~0.offset, #length] because there is no mapped edge [2019-12-07 12:58:48,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:58:48,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:58:48,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-607850233 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-607850233 |P1Thread1of1ForFork1_#t~ite9_Out-607850233|) (= |P1Thread1of1ForFork1_#t~ite8_In-607850233| |P1Thread1of1ForFork1_#t~ite8_Out-607850233|)) (and (= ~y$w_buff0~0_In-607850233 |P1Thread1of1ForFork1_#t~ite8_Out-607850233|) (= |P1Thread1of1ForFork1_#t~ite8_Out-607850233| |P1Thread1of1ForFork1_#t~ite9_Out-607850233|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-607850233 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-607850233 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-607850233 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-607850233 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-607850233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$w_buff0~0=~y$w_buff0~0_In-607850233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607850233, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-607850233|, ~weak$$choice2~0=~weak$$choice2~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-607850233, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-607850233|, ~y$w_buff0~0=~y$w_buff0~0_In-607850233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-607850233, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-607850233|, ~weak$$choice2~0=~weak$$choice2~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:58:48,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1397961587 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-1397961587| |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (= ~y$w_buff1~0_In-1397961587 |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1397961587 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1397961587 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1397961587 256))) (= 0 (mod ~y$w_buff0_used~0_In-1397961587 256))))) (and (= ~y$w_buff1~0_In-1397961587 |P1Thread1of1ForFork1_#t~ite12_Out-1397961587|) (= |P1Thread1of1ForFork1_#t~ite11_In-1397961587| |P1Thread1of1ForFork1_#t~ite11_Out-1397961587|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397961587, ~y$w_buff1~0=~y$w_buff1~0_In-1397961587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397961587, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397961587, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-1397961587|, ~weak$$choice2~0=~weak$$choice2~0_In-1397961587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397961587} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397961587, ~y$w_buff1~0=~y$w_buff1~0_In-1397961587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397961587, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397961587, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1397961587|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1397961587|, ~weak$$choice2~0=~weak$$choice2~0_In-1397961587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397961587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:58:48,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:58:48,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:58:48,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-592809762 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-592809762 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-592809762| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-592809762| ~y$w_buff0_used~0_In-592809762)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-592809762} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-592809762, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-592809762|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1813257112 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1813257112 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1813257112 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1813257112 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1813257112| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1813257112 |P2Thread1of1ForFork2_#t~ite29_Out-1813257112|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1813257112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1813257112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1813257112} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1813257112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1813257112, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1813257112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1813257112} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In115148202 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In115148202 ~y$r_buff0_thd3~0_Out115148202)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In115148202 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out115148202)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In115148202, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In115148202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In115148202, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out115148202|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out115148202} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2131040669 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2131040669 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2131040669 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2131040669 256)))) (or (and (= ~y$r_buff1_thd3~0_In-2131040669 |P2Thread1of1ForFork2_#t~ite31_Out-2131040669|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-2131040669|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2131040669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131040669, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2131040669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131040669} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2131040669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131040669, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2131040669|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2131040669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131040669} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:58:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In2063095556 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2063095556 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2063095556| ~y$w_buff1~0_In2063095556)) (and (= |ULTIMATE.start_main_#t~ite35_Out2063095556| ~y~0_In2063095556) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2063095556, ~y~0=~y~0_In2063095556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063095556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063095556} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2063095556, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2063095556|, ~y~0=~y~0_In2063095556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063095556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063095556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:58:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:58:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In220878207 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In220878207 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out220878207| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In220878207 |ULTIMATE.start_main_#t~ite37_Out220878207|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In220878207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In220878207} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In220878207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In220878207, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out220878207|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:58:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In974177362 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In974177362 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In974177362 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In974177362 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In974177362 |ULTIMATE.start_main_#t~ite38_Out974177362|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out974177362| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974177362, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974177362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974177362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In974177362, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out974177362|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974177362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974177362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:58:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In181318979 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In181318979 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out181318979| ~y$r_buff0_thd0~0_In181318979) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out181318979| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In181318979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181318979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In181318979, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out181318979|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181318979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:58:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1090179666 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1090179666 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1090179666 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1090179666 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1090179666| ~y$r_buff1_thd0~0_In1090179666) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1090179666|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1090179666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1090179666, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1090179666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1090179666} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1090179666|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1090179666, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1090179666, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1090179666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1090179666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:58:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:58:48,866 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ec6aa46-1cc3-4b68-b6ec-fca296376e17/bin/uautomizer/witness.graphml [2019-12-07 12:58:48,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:58:48,868 INFO L168 Benchmark]: Toolchain (without parser) took 12556.43 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 961.5 MB). Free memory was 939.8 MB in the beginning and 1.3 GB in the end (delta: -401.9 MB). Peak memory consumption was 559.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,868 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:48,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,869 INFO L168 Benchmark]: Boogie Preprocessor took 24.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:58:48,869 INFO L168 Benchmark]: RCFGBuilder took 381.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,869 INFO L168 Benchmark]: TraceAbstraction took 11674.30 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -328.7 MB). Peak memory consumption was 506.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,869 INFO L168 Benchmark]: Witness Printer took 57.64 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:58:48,871 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 381.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11674.30 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 835.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -328.7 MB). Peak memory consumption was 506.5 MB. Max. memory is 11.5 GB. * Witness Printer took 57.64 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2688 SDtfs, 2337 SDslu, 4920 SDs, 0 SdLazy, 2757 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25276occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 19017 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 67700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...