/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:20:10,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:20:10,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:20:10,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:20:10,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:20:10,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:20:10,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:20:10,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:20:10,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:20:10,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:20:10,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:20:10,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:20:10,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:20:10,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:20:10,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:20:10,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:20:10,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:20:10,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:20:10,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:20:10,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:20:10,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:20:10,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:20:10,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:20:10,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:20:10,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:20:10,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:20:10,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:20:10,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:20:10,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:20:10,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:20:10,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:20:10,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:20:10,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:20:10,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:20:10,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:20:10,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:20:10,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:20:10,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:20:10,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:20:10,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:20:10,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:20:10,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:20:10,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:20:10,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:20:10,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:20:10,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:20:10,515 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:20:10,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:20:10,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:20:10,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:20:10,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:20:10,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:20:10,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:20:10,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:20:10,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:20:10,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:20:10,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:20:10,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:20:10,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:20:10,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:20:10,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:20:10,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:20:10,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:20:10,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:20:10,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:20:10,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:20:10,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:20:10,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:20:10,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:20:10,520 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:20:10,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:20:10,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:20:10,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:20:10,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:20:10,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:20:10,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:20:10,863 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:20:10,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-27 05:20:10,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961688d92/852919bb5ad3469b94b5c035360ba5c4/FLAGb2f5cd7ed [2019-12-27 05:20:11,556 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:20:11,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-27 05:20:11,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961688d92/852919bb5ad3469b94b5c035360ba5c4/FLAGb2f5cd7ed [2019-12-27 05:20:11,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961688d92/852919bb5ad3469b94b5c035360ba5c4 [2019-12-27 05:20:11,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:20:11,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:20:11,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:20:11,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:20:11,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:20:11,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:20:11" (1/1) ... [2019-12-27 05:20:11,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b01ee4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:11, skipping insertion in model container [2019-12-27 05:20:11,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:20:11" (1/1) ... [2019-12-27 05:20:11,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:20:11,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:20:12,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:20:12,469 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:20:12,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:20:12,716 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:20:12,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12 WrapperNode [2019-12-27 05:20:12,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:20:12,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:20:12,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:20:12,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:20:12,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:20:12,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:20:12,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:20:12,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:20:12,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... [2019-12-27 05:20:12,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:20:12,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:20:12,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:20:12,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:20:12,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:20:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:20:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:20:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:20:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:20:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:20:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:20:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:20:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:20:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:20:12,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:20:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:20:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:20:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:20:12,974 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:20:13,768 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:20:13,768 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:20:13,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:20:13 BoogieIcfgContainer [2019-12-27 05:20:13,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:20:13,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:20:13,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:20:13,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:20:13,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:20:11" (1/3) ... [2019-12-27 05:20:13,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1c16ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:20:13, skipping insertion in model container [2019-12-27 05:20:13,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:12" (2/3) ... [2019-12-27 05:20:13,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1c16ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:20:13, skipping insertion in model container [2019-12-27 05:20:13,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:20:13" (3/3) ... [2019-12-27 05:20:13,779 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.oepc.i [2019-12-27 05:20:13,790 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:20:13,791 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:20:13,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:20:13,806 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:20:13,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,853 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,854 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,894 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,895 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,935 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,937 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:13,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:20:13,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:20:13,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:20:13,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:20:13,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:20:13,998 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:20:13,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:20:13,999 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:20:13,999 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:20:14,015 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 05:20:14,018 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:20:14,183 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:20:14,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:20:14,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:20:14,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:20:14,373 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:20:14,374 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:20:14,387 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:20:14,408 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:20:14,409 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:20:17,974 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:20:18,124 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:20:18,154 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-27 05:20:18,154 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 05:20:18,158 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-27 05:20:46,138 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-27 05:20:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-27 05:20:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:20:46,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:20:46,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:20:46,147 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:20:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:20:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-27 05:20:46,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:20:46,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851363939] [2019-12-27 05:20:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:20:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:20:46,363 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-27 05:20:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851363939] [2019-12-27 05:20:46,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:20:46,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:20:46,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550716685] [2019-12-27 05:20:46,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:20:46,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:20:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:20:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:20:46,384 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-27 05:20:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:20:49,600 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-27 05:20:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:20:49,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:20:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:20:50,689 INFO L225 Difference]: With dead ends: 137016 [2019-12-27 05:20:50,689 INFO L226 Difference]: Without dead ends: 128980 [2019-12-27 05:20:50,690 INFO L631 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-27 05:20:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-27 05:21:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-27 05:21:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-27 05:21:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-27 05:21:07,026 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-27 05:21:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:07,026 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-27 05:21:07,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-27 05:21:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:21:07,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:07,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:07,032 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-27 05:21:07,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:07,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341148746] [2019-12-27 05:21:07,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:07,174 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-27 05:21:07,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341148746] [2019-12-27 05:21:07,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:07,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:07,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278380061] [2019-12-27 05:21:07,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:07,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:07,178 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-27 05:21:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:13,409 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-27 05:21:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:13,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:21:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:14,082 INFO L225 Difference]: With dead ends: 200378 [2019-12-27 05:21:14,082 INFO L226 Difference]: Without dead ends: 200329 [2019-12-27 05:21:14,083 INFO L631 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-27 05:21:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-27 05:21:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-27 05:21:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-27 05:21:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-27 05:21:27,005 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-27 05:21:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:27,006 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-27 05:21:27,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-27 05:21:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:21:27,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:27,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:27,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-27 05:21:27,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:27,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238670178] [2019-12-27 05:21:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:27,070 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-27 05:21:27,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238670178] [2019-12-27 05:21:27,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:27,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:27,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833473986] [2019-12-27 05:21:27,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:27,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:27,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:27,073 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-27 05:21:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:27,205 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-27 05:21:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:27,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:21:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:27,265 INFO L225 Difference]: With dead ends: 38211 [2019-12-27 05:21:27,265 INFO L226 Difference]: Without dead ends: 38211 [2019-12-27 05:21:27,265 INFO L631 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-27 05:21:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-27 05:21:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-27 05:21:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-27 05:21:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-27 05:21:33,830 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-27 05:21:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:33,830 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-27 05:21:33,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-27 05:21:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:21:33,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:33,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:33,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-27 05:21:33,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:33,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629182950] [2019-12-27 05:21:33,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:33,933 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-27 05:21:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629182950] [2019-12-27 05:21:33,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:33,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:33,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272306320] [2019-12-27 05:21:33,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:33,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:33,935 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-27 05:21:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:34,478 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-27 05:21:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:21:34,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:21:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:34,582 INFO L225 Difference]: With dead ends: 52954 [2019-12-27 05:21:34,582 INFO L226 Difference]: Without dead ends: 52954 [2019-12-27 05:21:34,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-27 05:21:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-27 05:21:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-27 05:21:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-27 05:21:35,907 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-27 05:21:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:35,907 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-27 05:21:35,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-27 05:21:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:21:35,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:35,921 INFO L411 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] [2019-12-27 05:21:35,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-27 05:21:35,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:35,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304245841] [2019-12-27 05:21:35,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:36,033 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-27 05:21:36,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304245841] [2019-12-27 05:21:36,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:36,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:21:36,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692633384] [2019-12-27 05:21:36,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:36,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:36,035 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 7 states. [2019-12-27 05:21:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:37,235 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-27 05:21:37,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:21:37,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 05:21:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:37,357 INFO L225 Difference]: With dead ends: 72804 [2019-12-27 05:21:37,358 INFO L226 Difference]: Without dead ends: 72790 [2019-12-27 05:21:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:21:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-27 05:21:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-27 05:21:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-27 05:21:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-27 05:21:39,000 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-27 05:21:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:39,000 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-27 05:21:39,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-27 05:21:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:21:39,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:39,018 INFO L411 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] [2019-12-27 05:21:39,018 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-27 05:21:39,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:39,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134212748] [2019-12-27 05:21:39,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:39,079 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-27 05:21:39,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134212748] [2019-12-27 05:21:39,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:39,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:39,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184176601] [2019-12-27 05:21:39,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:39,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:39,081 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 4 states. [2019-12-27 05:21:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:39,163 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-27 05:21:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:21:39,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:21:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:39,190 INFO L225 Difference]: With dead ends: 18102 [2019-12-27 05:21:39,190 INFO L226 Difference]: Without dead ends: 18102 [2019-12-27 05:21:39,190 INFO L631 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-27 05:21:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-27 05:21:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-27 05:21:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-27 05:21:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-27 05:21:39,459 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-27 05:21:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:39,460 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-27 05:21:39,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-27 05:21:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:21:39,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:39,473 INFO L411 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] [2019-12-27 05:21:39,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-27 05:21:39,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:39,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524513788] [2019-12-27 05:21:39,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:39,560 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-27 05:21:39,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524513788] [2019-12-27 05:21:39,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:39,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:39,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136444712] [2019-12-27 05:21:39,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:21:39,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:21:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:21:39,562 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-27 05:21:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:40,206 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-27 05:21:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:21:40,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:21:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:40,257 INFO L225 Difference]: With dead ends: 25666 [2019-12-27 05:21:40,257 INFO L226 Difference]: Without dead ends: 25666 [2019-12-27 05:21:40,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:21:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-27 05:21:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-27 05:21:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-27 05:21:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-27 05:21:40,626 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-27 05:21:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:40,627 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-27 05:21:40,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:21:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-27 05:21:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:21:40,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:40,648 INFO L411 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] [2019-12-27 05:21:40,649 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-27 05:21:40,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:40,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938688522] [2019-12-27 05:21:40,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:40,728 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-27 05:21:40,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938688522] [2019-12-27 05:21:40,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:40,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:40,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318486148] [2019-12-27 05:21:40,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:40,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:40,730 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 5 states. [2019-12-27 05:21:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:41,170 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-27 05:21:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:21:41,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:21:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:41,215 INFO L225 Difference]: With dead ends: 25941 [2019-12-27 05:21:41,215 INFO L226 Difference]: Without dead ends: 25941 [2019-12-27 05:21:41,215 INFO L631 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-27 05:21:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-27 05:21:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-27 05:21:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-27 05:21:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-27 05:21:41,892 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-27 05:21:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:41,892 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-27 05:21:41,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-27 05:21:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:21:41,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:41,919 INFO L411 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] [2019-12-27 05:21:41,919 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-27 05:21:41,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:41,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518660244] [2019-12-27 05:21:41,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:42,035 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-27 05:21:42,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518660244] [2019-12-27 05:21:42,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:42,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:42,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528470224] [2019-12-27 05:21:42,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:21:42,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:21:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:42,037 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 8 states. [2019-12-27 05:21:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:43,444 INFO L93 Difference]: Finished difference Result 29973 states and 87406 transitions. [2019-12-27 05:21:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:21:43,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:21:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:43,485 INFO L225 Difference]: With dead ends: 29973 [2019-12-27 05:21:43,485 INFO L226 Difference]: Without dead ends: 29973 [2019-12-27 05:21:43,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:21:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29973 states. [2019-12-27 05:21:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29973 to 18923. [2019-12-27 05:21:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18923 states. [2019-12-27 05:21:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18923 states to 18923 states and 56662 transitions. [2019-12-27 05:21:43,840 INFO L78 Accepts]: Start accepts. Automaton has 18923 states and 56662 transitions. Word has length 33 [2019-12-27 05:21:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:43,840 INFO L462 AbstractCegarLoop]: Abstraction has 18923 states and 56662 transitions. [2019-12-27 05:21:43,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:21:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18923 states and 56662 transitions. [2019-12-27 05:21:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:21:43,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:43,863 INFO L411 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] [2019-12-27 05:21:43,863 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-27 05:21:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:43,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449162667] [2019-12-27 05:21:43,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:43,932 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-27 05:21:43,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449162667] [2019-12-27 05:21:43,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:43,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:43,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651001579] [2019-12-27 05:21:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:43,934 INFO L87 Difference]: Start difference. First operand 18923 states and 56662 transitions. Second operand 3 states. [2019-12-27 05:21:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:44,019 INFO L93 Difference]: Finished difference Result 18922 states and 56660 transitions. [2019-12-27 05:21:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:44,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:21:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:44,059 INFO L225 Difference]: With dead ends: 18922 [2019-12-27 05:21:44,059 INFO L226 Difference]: Without dead ends: 18922 [2019-12-27 05:21:44,060 INFO L631 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-27 05:21:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2019-12-27 05:21:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18922. [2019-12-27 05:21:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-27 05:21:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 56660 transitions. [2019-12-27 05:21:44,410 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 56660 transitions. Word has length 39 [2019-12-27 05:21:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:44,410 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 56660 transitions. [2019-12-27 05:21:44,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 56660 transitions. [2019-12-27 05:21:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:44,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:44,430 INFO L411 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] [2019-12-27 05:21:44,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-27 05:21:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:44,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102853775] [2019-12-27 05:21:44,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:44,554 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-27 05:21:44,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102853775] [2019-12-27 05:21:44,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:44,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:44,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517187536] [2019-12-27 05:21:44,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:21:44,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:44,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:21:44,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:21:44,558 INFO L87 Difference]: Start difference. First operand 18922 states and 56660 transitions. Second operand 6 states. [2019-12-27 05:21:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:45,762 INFO L93 Difference]: Finished difference Result 37537 states and 112068 transitions. [2019-12-27 05:21:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:21:45,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:21:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:45,814 INFO L225 Difference]: With dead ends: 37537 [2019-12-27 05:21:45,815 INFO L226 Difference]: Without dead ends: 37537 [2019-12-27 05:21:45,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37537 states. [2019-12-27 05:21:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37537 to 23985. [2019-12-27 05:21:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23985 states. [2019-12-27 05:21:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 71737 transitions. [2019-12-27 05:21:46,255 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 71737 transitions. Word has length 40 [2019-12-27 05:21:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:46,256 INFO L462 AbstractCegarLoop]: Abstraction has 23985 states and 71737 transitions. [2019-12-27 05:21:46,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:21:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 71737 transitions. [2019-12-27 05:21:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:46,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:46,278 INFO L411 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] [2019-12-27 05:21:46,278 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1919201076, now seen corresponding path program 2 times [2019-12-27 05:21:46,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:46,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515494511] [2019-12-27 05:21:46,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:46,353 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-27 05:21:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515494511] [2019-12-27 05:21:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:21:46,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730541580] [2019-12-27 05:21:46,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:46,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:46,355 INFO L87 Difference]: Start difference. First operand 23985 states and 71737 transitions. Second operand 5 states. [2019-12-27 05:21:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:47,081 INFO L93 Difference]: Finished difference Result 32203 states and 96114 transitions. [2019-12-27 05:21:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:21:47,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:21:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:47,128 INFO L225 Difference]: With dead ends: 32203 [2019-12-27 05:21:47,129 INFO L226 Difference]: Without dead ends: 32203 [2019-12-27 05:21:47,129 INFO L631 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-27 05:21:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32203 states. [2019-12-27 05:21:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32203 to 28899. [2019-12-27 05:21:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28899 states. [2019-12-27 05:21:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28899 states to 28899 states and 86897 transitions. [2019-12-27 05:21:47,590 INFO L78 Accepts]: Start accepts. Automaton has 28899 states and 86897 transitions. Word has length 40 [2019-12-27 05:21:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:47,591 INFO L462 AbstractCegarLoop]: Abstraction has 28899 states and 86897 transitions. [2019-12-27 05:21:47,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28899 states and 86897 transitions. [2019-12-27 05:21:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:47,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:47,634 INFO L411 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] [2019-12-27 05:21:47,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1859885306, now seen corresponding path program 3 times [2019-12-27 05:21:47,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:47,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108402177] [2019-12-27 05:21:47,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:47,728 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-27 05:21:47,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108402177] [2019-12-27 05:21:47,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:47,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:47,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987920649] [2019-12-27 05:21:47,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:47,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:47,730 INFO L87 Difference]: Start difference. First operand 28899 states and 86897 transitions. Second operand 3 states. [2019-12-27 05:21:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:47,863 INFO L93 Difference]: Finished difference Result 28818 states and 86645 transitions. [2019-12-27 05:21:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:47,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:21:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:47,927 INFO L225 Difference]: With dead ends: 28818 [2019-12-27 05:21:47,927 INFO L226 Difference]: Without dead ends: 28818 [2019-12-27 05:21:47,928 INFO L631 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-27 05:21:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-27 05:21:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 24592. [2019-12-27 05:21:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24592 states. [2019-12-27 05:21:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24592 states to 24592 states and 74947 transitions. [2019-12-27 05:21:48,673 INFO L78 Accepts]: Start accepts. Automaton has 24592 states and 74947 transitions. Word has length 40 [2019-12-27 05:21:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:48,673 INFO L462 AbstractCegarLoop]: Abstraction has 24592 states and 74947 transitions. [2019-12-27 05:21:48,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 24592 states and 74947 transitions. [2019-12-27 05:21:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:21:48,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:48,700 INFO L411 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] [2019-12-27 05:21:48,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1927216762, now seen corresponding path program 1 times [2019-12-27 05:21:48,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:48,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156588238] [2019-12-27 05:21:48,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:48,758 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-27 05:21:48,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156588238] [2019-12-27 05:21:48,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:48,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:48,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154595866] [2019-12-27 05:21:48,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:48,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:48,760 INFO L87 Difference]: Start difference. First operand 24592 states and 74947 transitions. Second operand 5 states. [2019-12-27 05:21:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:48,882 INFO L93 Difference]: Finished difference Result 23362 states and 72210 transitions. [2019-12-27 05:21:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:48,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:21:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:48,926 INFO L225 Difference]: With dead ends: 23362 [2019-12-27 05:21:48,926 INFO L226 Difference]: Without dead ends: 22051 [2019-12-27 05:21:48,927 INFO L631 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-27 05:21:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22051 states. [2019-12-27 05:21:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22051 to 22051. [2019-12-27 05:21:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-12-27 05:21:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 68868 transitions. [2019-12-27 05:21:49,470 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 68868 transitions. Word has length 41 [2019-12-27 05:21:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:49,470 INFO L462 AbstractCegarLoop]: Abstraction has 22051 states and 68868 transitions. [2019-12-27 05:21:49,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 68868 transitions. [2019-12-27 05:21:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:49,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:49,494 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:49,494 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 359338126, now seen corresponding path program 1 times [2019-12-27 05:21:49,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:49,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451443088] [2019-12-27 05:21:49,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:49,548 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-27 05:21:49,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451443088] [2019-12-27 05:21:49,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:49,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:49,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768427918] [2019-12-27 05:21:49,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:49,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:49,550 INFO L87 Difference]: Start difference. First operand 22051 states and 68868 transitions. Second operand 3 states. [2019-12-27 05:21:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:49,706 INFO L93 Difference]: Finished difference Result 29595 states and 93088 transitions. [2019-12-27 05:21:49,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:49,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:21:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:49,753 INFO L225 Difference]: With dead ends: 29595 [2019-12-27 05:21:49,753 INFO L226 Difference]: Without dead ends: 29595 [2019-12-27 05:21:49,753 INFO L631 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-27 05:21:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29595 states. [2019-12-27 05:21:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29595 to 23831. [2019-12-27 05:21:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23831 states. [2019-12-27 05:21:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23831 states to 23831 states and 75499 transitions. [2019-12-27 05:21:50,187 INFO L78 Accepts]: Start accepts. Automaton has 23831 states and 75499 transitions. Word has length 65 [2019-12-27 05:21:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:50,187 INFO L462 AbstractCegarLoop]: Abstraction has 23831 states and 75499 transitions. [2019-12-27 05:21:50,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23831 states and 75499 transitions. [2019-12-27 05:21:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:50,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:50,214 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:50,214 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1347625235, now seen corresponding path program 1 times [2019-12-27 05:21:50,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:50,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512713965] [2019-12-27 05:21:50,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:50,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-27 05:21:50,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512713965] [2019-12-27 05:21:50,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:50,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:50,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717324732] [2019-12-27 05:21:50,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:50,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:50,329 INFO L87 Difference]: Start difference. First operand 23831 states and 75499 transitions. Second operand 7 states. [2019-12-27 05:21:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:51,167 INFO L93 Difference]: Finished difference Result 62749 states and 198693 transitions. [2019-12-27 05:21:51,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:21:51,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:21:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:51,240 INFO L225 Difference]: With dead ends: 62749 [2019-12-27 05:21:51,240 INFO L226 Difference]: Without dead ends: 47750 [2019-12-27 05:21:51,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:21:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47750 states. [2019-12-27 05:21:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47750 to 28081. [2019-12-27 05:21:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28081 states. [2019-12-27 05:21:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28081 states to 28081 states and 89069 transitions. [2019-12-27 05:21:51,876 INFO L78 Accepts]: Start accepts. Automaton has 28081 states and 89069 transitions. Word has length 65 [2019-12-27 05:21:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:51,877 INFO L462 AbstractCegarLoop]: Abstraction has 28081 states and 89069 transitions. [2019-12-27 05:21:51,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28081 states and 89069 transitions. [2019-12-27 05:21:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:51,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:51,910 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:51,911 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1859069805, now seen corresponding path program 2 times [2019-12-27 05:21:51,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:51,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120904265] [2019-12-27 05:21:51,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:52,001 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-27 05:21:52,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120904265] [2019-12-27 05:21:52,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:52,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:52,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52285386] [2019-12-27 05:21:52,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:52,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:52,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:52,004 INFO L87 Difference]: Start difference. First operand 28081 states and 89069 transitions. Second operand 7 states. [2019-12-27 05:21:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:52,673 INFO L93 Difference]: Finished difference Result 68805 states and 215395 transitions. [2019-12-27 05:21:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:21:52,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:21:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:52,799 INFO L225 Difference]: With dead ends: 68805 [2019-12-27 05:21:52,799 INFO L226 Difference]: Without dead ends: 49641 [2019-12-27 05:21:52,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:21:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49641 states. [2019-12-27 05:21:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49641 to 32073. [2019-12-27 05:21:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32073 states. [2019-12-27 05:21:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32073 states to 32073 states and 101393 transitions. [2019-12-27 05:21:53,574 INFO L78 Accepts]: Start accepts. Automaton has 32073 states and 101393 transitions. Word has length 65 [2019-12-27 05:21:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:53,574 INFO L462 AbstractCegarLoop]: Abstraction has 32073 states and 101393 transitions. [2019-12-27 05:21:53,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32073 states and 101393 transitions. [2019-12-27 05:21:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:54,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:54,014 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:54,014 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1166151863, now seen corresponding path program 3 times [2019-12-27 05:21:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:54,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613821357] [2019-12-27 05:21:54,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:54,125 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-27 05:21:54,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613821357] [2019-12-27 05:21:54,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:54,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:21:54,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243479544] [2019-12-27 05:21:54,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:21:54,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:54,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:21:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:54,129 INFO L87 Difference]: Start difference. First operand 32073 states and 101393 transitions. Second operand 8 states. [2019-12-27 05:21:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:55,272 INFO L93 Difference]: Finished difference Result 83655 states and 263314 transitions. [2019-12-27 05:21:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:21:55,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:21:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:55,407 INFO L225 Difference]: With dead ends: 83655 [2019-12-27 05:21:55,408 INFO L226 Difference]: Without dead ends: 74383 [2019-12-27 05:21:55,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:21:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74383 states. [2019-12-27 05:21:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74383 to 32593. [2019-12-27 05:21:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32593 states. [2019-12-27 05:21:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32593 states to 32593 states and 103411 transitions. [2019-12-27 05:21:56,326 INFO L78 Accepts]: Start accepts. Automaton has 32593 states and 103411 transitions. Word has length 65 [2019-12-27 05:21:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:56,326 INFO L462 AbstractCegarLoop]: Abstraction has 32593 states and 103411 transitions. [2019-12-27 05:21:56,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:21:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states and 103411 transitions. [2019-12-27 05:21:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:56,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:56,362 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:56,362 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1738755691, now seen corresponding path program 4 times [2019-12-27 05:21:56,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:56,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531493362] [2019-12-27 05:21:56,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:56,482 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-27 05:21:56,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531493362] [2019-12-27 05:21:56,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:56,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:21:56,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563974509] [2019-12-27 05:21:56,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:21:56,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:56,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:21:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:56,485 INFO L87 Difference]: Start difference. First operand 32593 states and 103411 transitions. Second operand 9 states. [2019-12-27 05:21:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:58,284 INFO L93 Difference]: Finished difference Result 101882 states and 317043 transitions. [2019-12-27 05:21:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:21:58,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:21:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:58,421 INFO L225 Difference]: With dead ends: 101882 [2019-12-27 05:21:58,421 INFO L226 Difference]: Without dead ends: 89306 [2019-12-27 05:21:58,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:21:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89306 states. [2019-12-27 05:21:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89306 to 32629. [2019-12-27 05:21:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32629 states. [2019-12-27 05:21:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32629 states to 32629 states and 103568 transitions. [2019-12-27 05:21:59,392 INFO L78 Accepts]: Start accepts. Automaton has 32629 states and 103568 transitions. Word has length 65 [2019-12-27 05:21:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:59,392 INFO L462 AbstractCegarLoop]: Abstraction has 32629 states and 103568 transitions. [2019-12-27 05:21:59,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:21:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32629 states and 103568 transitions. [2019-12-27 05:21:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:59,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:59,429 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:59,429 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:59,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2043240447, now seen corresponding path program 5 times [2019-12-27 05:21:59,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:59,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271198894] [2019-12-27 05:21:59,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:59,546 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-27 05:21:59,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271198894] [2019-12-27 05:21:59,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:59,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:21:59,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313656614] [2019-12-27 05:21:59,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:21:59,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:21:59,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:59,548 INFO L87 Difference]: Start difference. First operand 32629 states and 103568 transitions. Second operand 9 states. [2019-12-27 05:22:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:01,002 INFO L93 Difference]: Finished difference Result 113630 states and 353091 transitions. [2019-12-27 05:22:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:22:01,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:22:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:01,175 INFO L225 Difference]: With dead ends: 113630 [2019-12-27 05:22:01,176 INFO L226 Difference]: Without dead ends: 105070 [2019-12-27 05:22:01,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:22:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105070 states. [2019-12-27 05:22:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105070 to 32666. [2019-12-27 05:22:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32666 states. [2019-12-27 05:22:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32666 states to 32666 states and 103730 transitions. [2019-12-27 05:22:02,796 INFO L78 Accepts]: Start accepts. Automaton has 32666 states and 103730 transitions. Word has length 65 [2019-12-27 05:22:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:02,796 INFO L462 AbstractCegarLoop]: Abstraction has 32666 states and 103730 transitions. [2019-12-27 05:22:02,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32666 states and 103730 transitions. [2019-12-27 05:22:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:22:02,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:02,833 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:02,833 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash -20463533, now seen corresponding path program 6 times [2019-12-27 05:22:02,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:02,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821615887] [2019-12-27 05:22:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:02,893 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-27 05:22:02,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821615887] [2019-12-27 05:22:02,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:02,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:02,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567396211] [2019-12-27 05:22:02,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:02,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:02,896 INFO L87 Difference]: Start difference. First operand 32666 states and 103730 transitions. Second operand 3 states. [2019-12-27 05:22:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:03,082 INFO L93 Difference]: Finished difference Result 38120 states and 120184 transitions. [2019-12-27 05:22:03,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:03,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:22:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:03,137 INFO L225 Difference]: With dead ends: 38120 [2019-12-27 05:22:03,137 INFO L226 Difference]: Without dead ends: 38120 [2019-12-27 05:22:03,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 05:22:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38120 states. [2019-12-27 05:22:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38120 to 33450. [2019-12-27 05:22:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33450 states. [2019-12-27 05:22:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33450 states to 33450 states and 106577 transitions. [2019-12-27 05:22:03,735 INFO L78 Accepts]: Start accepts. Automaton has 33450 states and 106577 transitions. Word has length 65 [2019-12-27 05:22:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:03,735 INFO L462 AbstractCegarLoop]: Abstraction has 33450 states and 106577 transitions. [2019-12-27 05:22:03,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33450 states and 106577 transitions. [2019-12-27 05:22:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:03,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:03,776 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:03,776 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1278998798, now seen corresponding path program 1 times [2019-12-27 05:22:03,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:03,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368471432] [2019-12-27 05:22:03,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:03,828 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-27 05:22:03,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368471432] [2019-12-27 05:22:03,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:03,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:03,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42357421] [2019-12-27 05:22:03,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:03,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:03,830 INFO L87 Difference]: Start difference. First operand 33450 states and 106577 transitions. Second operand 4 states. [2019-12-27 05:22:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:04,841 INFO L93 Difference]: Finished difference Result 50231 states and 159658 transitions. [2019-12-27 05:22:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:22:04,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:22:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:04,974 INFO L225 Difference]: With dead ends: 50231 [2019-12-27 05:22:04,975 INFO L226 Difference]: Without dead ends: 50231 [2019-12-27 05:22:04,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 05:22:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50231 states. [2019-12-27 05:22:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50231 to 36246. [2019-12-27 05:22:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36246 states. [2019-12-27 05:22:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36246 states to 36246 states and 116509 transitions. [2019-12-27 05:22:05,757 INFO L78 Accepts]: Start accepts. Automaton has 36246 states and 116509 transitions. Word has length 66 [2019-12-27 05:22:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:05,757 INFO L462 AbstractCegarLoop]: Abstraction has 36246 states and 116509 transitions. [2019-12-27 05:22:05,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 36246 states and 116509 transitions. [2019-12-27 05:22:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:05,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:05,799 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:05,800 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 438587114, now seen corresponding path program 2 times [2019-12-27 05:22:05,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:05,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332461329] [2019-12-27 05:22:05,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:05,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-27 05:22:05,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332461329] [2019-12-27 05:22:05,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:05,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:05,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042318803] [2019-12-27 05:22:05,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:05,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:05,844 INFO L87 Difference]: Start difference. First operand 36246 states and 116509 transitions. Second operand 4 states. [2019-12-27 05:22:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:06,106 INFO L93 Difference]: Finished difference Result 44212 states and 140524 transitions. [2019-12-27 05:22:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:06,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:22:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:06,173 INFO L225 Difference]: With dead ends: 44212 [2019-12-27 05:22:06,173 INFO L226 Difference]: Without dead ends: 44212 [2019-12-27 05:22:06,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 05:22:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44212 states. [2019-12-27 05:22:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44212 to 36317. [2019-12-27 05:22:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36317 states. [2019-12-27 05:22:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36317 states to 36317 states and 116799 transitions. [2019-12-27 05:22:06,836 INFO L78 Accepts]: Start accepts. Automaton has 36317 states and 116799 transitions. Word has length 66 [2019-12-27 05:22:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:06,836 INFO L462 AbstractCegarLoop]: Abstraction has 36317 states and 116799 transitions. [2019-12-27 05:22:06,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36317 states and 116799 transitions. [2019-12-27 05:22:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:06,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:06,877 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:06,878 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:06,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1493977688, now seen corresponding path program 3 times [2019-12-27 05:22:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:06,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504344095] [2019-12-27 05:22:06,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:06,966 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-27 05:22:06,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504344095] [2019-12-27 05:22:06,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:06,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:22:06,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780367213] [2019-12-27 05:22:06,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:22:06,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:06,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:22:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:22:06,968 INFO L87 Difference]: Start difference. First operand 36317 states and 116799 transitions. Second operand 8 states. [2019-12-27 05:22:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:08,569 INFO L93 Difference]: Finished difference Result 108826 states and 341914 transitions. [2019-12-27 05:22:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:22:08,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 05:22:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:08,720 INFO L225 Difference]: With dead ends: 108826 [2019-12-27 05:22:08,720 INFO L226 Difference]: Without dead ends: 96852 [2019-12-27 05:22:08,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96852 states. [2019-12-27 05:22:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96852 to 36319. [2019-12-27 05:22:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36319 states. [2019-12-27 05:22:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36319 states to 36319 states and 116796 transitions. [2019-12-27 05:22:09,870 INFO L78 Accepts]: Start accepts. Automaton has 36319 states and 116796 transitions. Word has length 66 [2019-12-27 05:22:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:09,871 INFO L462 AbstractCegarLoop]: Abstraction has 36319 states and 116796 transitions. [2019-12-27 05:22:09,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:22:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36319 states and 116796 transitions. [2019-12-27 05:22:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:09,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:09,912 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:09,912 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 183520316, now seen corresponding path program 4 times [2019-12-27 05:22:09,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:09,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521790899] [2019-12-27 05:22:09,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:10,007 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-27 05:22:10,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521790899] [2019-12-27 05:22:10,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:10,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:10,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249382673] [2019-12-27 05:22:10,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:10,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:10,010 INFO L87 Difference]: Start difference. First operand 36319 states and 116796 transitions. Second operand 9 states. [2019-12-27 05:22:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:11,644 INFO L93 Difference]: Finished difference Result 126434 states and 397052 transitions. [2019-12-27 05:22:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:22:11,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:22:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:12,367 INFO L225 Difference]: With dead ends: 126434 [2019-12-27 05:22:12,368 INFO L226 Difference]: Without dead ends: 114748 [2019-12-27 05:22:12,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:22:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114748 states. [2019-12-27 05:22:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114748 to 36303. [2019-12-27 05:22:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36303 states. [2019-12-27 05:22:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36303 states to 36303 states and 116611 transitions. [2019-12-27 05:22:13,530 INFO L78 Accepts]: Start accepts. Automaton has 36303 states and 116611 transitions. Word has length 66 [2019-12-27 05:22:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:13,530 INFO L462 AbstractCegarLoop]: Abstraction has 36303 states and 116611 transitions. [2019-12-27 05:22:13,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36303 states and 116611 transitions. [2019-12-27 05:22:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:13,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:13,571 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:13,572 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1510431144, now seen corresponding path program 5 times [2019-12-27 05:22:13,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:13,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368969188] [2019-12-27 05:22:13,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:13,683 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-27 05:22:13,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368969188] [2019-12-27 05:22:13,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:13,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:13,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745382016] [2019-12-27 05:22:13,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:13,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:13,686 INFO L87 Difference]: Start difference. First operand 36303 states and 116611 transitions. Second operand 9 states. [2019-12-27 05:22:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:15,492 INFO L93 Difference]: Finished difference Result 142418 states and 447631 transitions. [2019-12-27 05:22:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:22:15,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:22:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:15,682 INFO L225 Difference]: With dead ends: 142418 [2019-12-27 05:22:15,682 INFO L226 Difference]: Without dead ends: 119348 [2019-12-27 05:22:15,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:22:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119348 states. [2019-12-27 05:22:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119348 to 38548. [2019-12-27 05:22:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38548 states. [2019-12-27 05:22:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38548 states to 38548 states and 124737 transitions. [2019-12-27 05:22:17,574 INFO L78 Accepts]: Start accepts. Automaton has 38548 states and 124737 transitions. Word has length 66 [2019-12-27 05:22:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:17,574 INFO L462 AbstractCegarLoop]: Abstraction has 38548 states and 124737 transitions. [2019-12-27 05:22:17,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 38548 states and 124737 transitions. [2019-12-27 05:22:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:17,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:17,621 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:17,621 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1869416178, now seen corresponding path program 1 times [2019-12-27 05:22:17,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:17,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859869984] [2019-12-27 05:22:17,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:17,695 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-27 05:22:17,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859869984] [2019-12-27 05:22:17,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:17,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:17,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599251605] [2019-12-27 05:22:17,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:17,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:17,697 INFO L87 Difference]: Start difference. First operand 38548 states and 124737 transitions. Second operand 3 states. [2019-12-27 05:22:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:17,845 INFO L93 Difference]: Finished difference Result 30561 states and 97348 transitions. [2019-12-27 05:22:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:17,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:22:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:17,909 INFO L225 Difference]: With dead ends: 30561 [2019-12-27 05:22:17,909 INFO L226 Difference]: Without dead ends: 30561 [2019-12-27 05:22:17,910 INFO L631 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-27 05:22:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30561 states. [2019-12-27 05:22:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30561 to 28023. [2019-12-27 05:22:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28023 states. [2019-12-27 05:22:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28023 states to 28023 states and 89084 transitions. [2019-12-27 05:22:18,371 INFO L78 Accepts]: Start accepts. Automaton has 28023 states and 89084 transitions. Word has length 66 [2019-12-27 05:22:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:18,371 INFO L462 AbstractCegarLoop]: Abstraction has 28023 states and 89084 transitions. [2019-12-27 05:22:18,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28023 states and 89084 transitions. [2019-12-27 05:22:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:18,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:18,402 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:18,402 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1833062279, now seen corresponding path program 1 times [2019-12-27 05:22:18,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:18,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459728313] [2019-12-27 05:22:18,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:18,540 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-27 05:22:18,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459728313] [2019-12-27 05:22:18,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:18,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:18,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93764108] [2019-12-27 05:22:18,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:18,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:18,542 INFO L87 Difference]: Start difference. First operand 28023 states and 89084 transitions. Second operand 9 states. [2019-12-27 05:22:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:20,045 INFO L93 Difference]: Finished difference Result 51324 states and 161649 transitions. [2019-12-27 05:22:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:22:20,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 05:22:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:20,126 INFO L225 Difference]: With dead ends: 51324 [2019-12-27 05:22:20,127 INFO L226 Difference]: Without dead ends: 42706 [2019-12-27 05:22:20,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42706 states. [2019-12-27 05:22:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42706 to 28818. [2019-12-27 05:22:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28818 states. [2019-12-27 05:22:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28818 states to 28818 states and 91068 transitions. [2019-12-27 05:22:21,026 INFO L78 Accepts]: Start accepts. Automaton has 28818 states and 91068 transitions. Word has length 67 [2019-12-27 05:22:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:21,026 INFO L462 AbstractCegarLoop]: Abstraction has 28818 states and 91068 transitions. [2019-12-27 05:22:21,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28818 states and 91068 transitions. [2019-12-27 05:22:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:21,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:21,062 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:21,062 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-27 05:22:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963709315] [2019-12-27 05:22:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:21,119 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-27 05:22:21,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963709315] [2019-12-27 05:22:21,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:21,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:21,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553992503] [2019-12-27 05:22:21,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:21,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:21,121 INFO L87 Difference]: Start difference. First operand 28818 states and 91068 transitions. Second operand 4 states. [2019-12-27 05:22:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:21,294 INFO L93 Difference]: Finished difference Result 28818 states and 90844 transitions. [2019-12-27 05:22:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:21,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 05:22:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:21,352 INFO L225 Difference]: With dead ends: 28818 [2019-12-27 05:22:21,352 INFO L226 Difference]: Without dead ends: 28818 [2019-12-27 05:22:21,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-27 05:22:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 23876. [2019-12-27 05:22:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23876 states. [2019-12-27 05:22:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23876 states to 23876 states and 74879 transitions. [2019-12-27 05:22:21,999 INFO L78 Accepts]: Start accepts. Automaton has 23876 states and 74879 transitions. Word has length 67 [2019-12-27 05:22:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:21,999 INFO L462 AbstractCegarLoop]: Abstraction has 23876 states and 74879 transitions. [2019-12-27 05:22:21,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23876 states and 74879 transitions. [2019-12-27 05:22:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:22,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:22,024 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:22,024 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-27 05:22:22,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:22,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763795713] [2019-12-27 05:22:22,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:22,184 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-27 05:22:22,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763795713] [2019-12-27 05:22:22,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:22,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:22,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964252540] [2019-12-27 05:22:22,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:22:22,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:22:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:22,186 INFO L87 Difference]: Start difference. First operand 23876 states and 74879 transitions. Second operand 10 states. [2019-12-27 05:22:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:23,481 INFO L93 Difference]: Finished difference Result 46390 states and 144713 transitions. [2019-12-27 05:22:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:22:23,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:22:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:23,566 INFO L225 Difference]: With dead ends: 46390 [2019-12-27 05:22:23,566 INFO L226 Difference]: Without dead ends: 44475 [2019-12-27 05:22:23,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:22:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44475 states. [2019-12-27 05:22:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44475 to 27381. [2019-12-27 05:22:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27381 states. [2019-12-27 05:22:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27381 states to 27381 states and 85851 transitions. [2019-12-27 05:22:24,143 INFO L78 Accepts]: Start accepts. Automaton has 27381 states and 85851 transitions. Word has length 67 [2019-12-27 05:22:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:24,143 INFO L462 AbstractCegarLoop]: Abstraction has 27381 states and 85851 transitions. [2019-12-27 05:22:24,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:22:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27381 states and 85851 transitions. [2019-12-27 05:22:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:24,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:24,175 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:24,175 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1322343339, now seen corresponding path program 2 times [2019-12-27 05:22:24,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:24,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710539682] [2019-12-27 05:22:24,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:24,305 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-27 05:22:24,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710539682] [2019-12-27 05:22:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:24,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030217327] [2019-12-27 05:22:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:22:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:22:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:24,306 INFO L87 Difference]: Start difference. First operand 27381 states and 85851 transitions. Second operand 10 states. [2019-12-27 05:22:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:25,480 INFO L93 Difference]: Finished difference Result 45108 states and 140350 transitions. [2019-12-27 05:22:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:22:25,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:22:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:25,533 INFO L225 Difference]: With dead ends: 45108 [2019-12-27 05:22:25,534 INFO L226 Difference]: Without dead ends: 38197 [2019-12-27 05:22:25,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38197 states. [2019-12-27 05:22:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38197 to 23343. [2019-12-27 05:22:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23343 states. [2019-12-27 05:22:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23343 states to 23343 states and 72983 transitions. [2019-12-27 05:22:26,000 INFO L78 Accepts]: Start accepts. Automaton has 23343 states and 72983 transitions. Word has length 67 [2019-12-27 05:22:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:26,000 INFO L462 AbstractCegarLoop]: Abstraction has 23343 states and 72983 transitions. [2019-12-27 05:22:26,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:22:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 23343 states and 72983 transitions. [2019-12-27 05:22:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:26,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:26,025 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:26,025 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-27 05:22:26,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:26,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306163471] [2019-12-27 05:22:26,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:26,179 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-27 05:22:26,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306163471] [2019-12-27 05:22:26,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:26,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:26,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782458824] [2019-12-27 05:22:26,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:26,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:26,181 INFO L87 Difference]: Start difference. First operand 23343 states and 72983 transitions. Second operand 11 states. [2019-12-27 05:22:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:27,239 INFO L93 Difference]: Finished difference Result 40953 states and 127325 transitions. [2019-12-27 05:22:27,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:22:27,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:27,302 INFO L225 Difference]: With dead ends: 40953 [2019-12-27 05:22:27,302 INFO L226 Difference]: Without dead ends: 39934 [2019-12-27 05:22:27,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:22:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39934 states. [2019-12-27 05:22:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39934 to 25853. [2019-12-27 05:22:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25853 states. [2019-12-27 05:22:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25853 states to 25853 states and 80834 transitions. [2019-12-27 05:22:27,842 INFO L78 Accepts]: Start accepts. Automaton has 25853 states and 80834 transitions. Word has length 67 [2019-12-27 05:22:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:27,843 INFO L462 AbstractCegarLoop]: Abstraction has 25853 states and 80834 transitions. [2019-12-27 05:22:27,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 25853 states and 80834 transitions. [2019-12-27 05:22:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:27,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:27,871 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:27,871 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1906777599, now seen corresponding path program 4 times [2019-12-27 05:22:27,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785100000] [2019-12-27 05:22:27,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:28,039 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-27 05:22:28,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785100000] [2019-12-27 05:22:28,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:28,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:28,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682795073] [2019-12-27 05:22:28,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:28,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:28,040 INFO L87 Difference]: Start difference. First operand 25853 states and 80834 transitions. Second operand 11 states. [2019-12-27 05:22:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:28,977 INFO L93 Difference]: Finished difference Result 40530 states and 125593 transitions. [2019-12-27 05:22:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:22:28,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:29,031 INFO L225 Difference]: With dead ends: 40530 [2019-12-27 05:22:29,031 INFO L226 Difference]: Without dead ends: 37232 [2019-12-27 05:22:29,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:22:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37232 states. [2019-12-27 05:22:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37232 to 22900. [2019-12-27 05:22:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22900 states. [2019-12-27 05:22:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22900 states to 22900 states and 71486 transitions. [2019-12-27 05:22:29,892 INFO L78 Accepts]: Start accepts. Automaton has 22900 states and 71486 transitions. Word has length 67 [2019-12-27 05:22:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:29,892 INFO L462 AbstractCegarLoop]: Abstraction has 22900 states and 71486 transitions. [2019-12-27 05:22:29,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22900 states and 71486 transitions. [2019-12-27 05:22:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:29,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:29,919 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:29,919 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 5 times [2019-12-27 05:22:29,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:29,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328215646] [2019-12-27 05:22:29,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:30,084 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-27 05:22:30,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328215646] [2019-12-27 05:22:30,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:30,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:22:30,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842182599] [2019-12-27 05:22:30,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:22:30,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:30,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:22:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:22:30,090 INFO L87 Difference]: Start difference. First operand 22900 states and 71486 transitions. Second operand 12 states. [2019-12-27 05:22:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:30,990 INFO L93 Difference]: Finished difference Result 37415 states and 115863 transitions. [2019-12-27 05:22:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:22:30,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:22:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:31,042 INFO L225 Difference]: With dead ends: 37415 [2019-12-27 05:22:31,043 INFO L226 Difference]: Without dead ends: 37200 [2019-12-27 05:22:31,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:22:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37200 states. [2019-12-27 05:22:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37200 to 22724. [2019-12-27 05:22:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22724 states. [2019-12-27 05:22:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 71014 transitions. [2019-12-27 05:22:31,503 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 71014 transitions. Word has length 67 [2019-12-27 05:22:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:31,503 INFO L462 AbstractCegarLoop]: Abstraction has 22724 states and 71014 transitions. [2019-12-27 05:22:31,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:22:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 71014 transitions. [2019-12-27 05:22:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:31,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:31,527 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:31,527 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 6 times [2019-12-27 05:22:31,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:31,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86113675] [2019-12-27 05:22:31,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:31,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:22:31,655 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:22:31,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_25|) |v_ULTIMATE.start_main_~#t263~0.offset_19| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= v_~a$r_buff0_thd1~0_27 0) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t263~0.base_25| 4)) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= (store .cse0 |v_ULTIMATE.start_main_~#t263~0.base_25| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t263~0.base_25|) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t263~0.base_25|)) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= v_~main$tmp_guard0~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t263~0.offset_19|) (= v_~a$r_buff0_thd0~0_21 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t263~0.offset=|v_ULTIMATE.start_main_~#t263~0.offset_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_17|, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_8, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_17|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t263~0.base=|v_ULTIMATE.start_main_~#t263~0.base_25|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_21|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t263~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t265~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t264~0.offset, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t265~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t263~0.base, #NULL.base, ULTIMATE.start_main_~#t264~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:22:31,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:22:31,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12|) |v_ULTIMATE.start_main_~#t264~0.offset_10| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t264~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t264~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t264~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t264~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_12|, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t264~0.base, ULTIMATE.start_main_~#t264~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:22:31,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t265~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t265~0.base_12|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t265~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12|) |v_ULTIMATE.start_main_~#t265~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t265~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t265~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t265~0.base] because there is no mapped edge [2019-12-27 05:22:31,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1699965945 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1699965945 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1699965945| ~a$w_buff1~0_In1699965945)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1699965945| ~a~0_In1699965945)))) InVars {~a~0=~a~0_In1699965945, ~a$w_buff1~0=~a$w_buff1~0_In1699965945, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1699965945, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699965945} OutVars{~a~0=~a~0_In1699965945, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1699965945|, ~a$w_buff1~0=~a$w_buff1~0_In1699965945, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1699965945, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699965945} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:22:31,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:22:31,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1061431393 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1061431393 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1061431393| ~a$w_buff0_used~0_In1061431393)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1061431393| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061431393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061431393} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061431393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061431393, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1061431393|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:22:31,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1220761953 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1220761953 256)))) (or (and (= ~a$w_buff0_used~0_In1220761953 |P0Thread1of1ForFork1_#t~ite5_Out1220761953|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1220761953|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1220761953, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1220761953} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1220761953|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1220761953, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1220761953} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:22:31,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1590220100 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1590220100 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1590220100 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1590220100 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1590220100 |P0Thread1of1ForFork1_#t~ite6_Out1590220100|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1590220100|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1590220100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1590220100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1590220100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1590220100} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1590220100|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1590220100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1590220100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1590220100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1590220100} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:22:31,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-188747790 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-188747790 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-188747790 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-188747790 ~a$r_buff0_thd1~0_In-188747790)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-188747790, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-188747790} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-188747790|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188747790, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-188747790} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:22:31,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1472120494 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1472120494 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In1472120494 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1472120494 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1472120494| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out1472120494| ~a$r_buff1_thd1~0_In1472120494) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1472120494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1472120494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472120494} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1472120494|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1472120494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1472120494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1472120494} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:22:31,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:22:31,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1872517423 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1872517423| |P2Thread1of1ForFork0_#t~ite20_Out-1872517423|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1872517423| ~a$w_buff0~0_In-1872517423)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1872517423| |P2Thread1of1ForFork0_#t~ite20_Out-1872517423|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-1872517423| ~a$w_buff0~0_In-1872517423) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1872517423 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1872517423 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1872517423 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1872517423 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1872517423, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1872517423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1872517423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1872517423|, ~weak$$choice2~0=~weak$$choice2~0_In-1872517423} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1872517423|, ~a$w_buff0~0=~a$w_buff0~0_In-1872517423, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1872517423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1872517423, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1872517423|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423, ~weak$$choice2~0=~weak$$choice2~0_In-1872517423} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:22:31,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1943800216 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1943800216| |P2Thread1of1ForFork0_#t~ite26_Out-1943800216|) (not .cse0) (= ~a$w_buff0_used~0_In-1943800216 |P2Thread1of1ForFork0_#t~ite27_Out-1943800216|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1943800216 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1943800216 256) 0)) (= (mod ~a$w_buff0_used~0_In-1943800216 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1943800216 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-1943800216| |P2Thread1of1ForFork0_#t~ite26_Out-1943800216|) (= ~a$w_buff0_used~0_In-1943800216 |P2Thread1of1ForFork0_#t~ite26_Out-1943800216|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1943800216|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943800216, ~weak$$choice2~0=~weak$$choice2~0_In-1943800216} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1943800216|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1943800216|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1943800216, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1943800216, ~weak$$choice2~0=~weak$$choice2~0_In-1943800216} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:22:31,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:22:31,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:22:31,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1890345947 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1890345947 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1890345947| |P2Thread1of1ForFork0_#t~ite39_Out1890345947|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1890345947| ~a~0_In1890345947) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1890345947| ~a$w_buff1~0_In1890345947) (not .cse0) .cse2))) InVars {~a~0=~a~0_In1890345947, ~a$w_buff1~0=~a$w_buff1~0_In1890345947, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1890345947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1890345947} OutVars{~a~0=~a~0_In1890345947, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1890345947|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1890345947|, ~a$w_buff1~0=~a$w_buff1~0_In1890345947, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1890345947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1890345947} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:22:31,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-813173510 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-813173510 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-813173510|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-813173510 |P2Thread1of1ForFork0_#t~ite40_Out-813173510|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-813173510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-813173510} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-813173510|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-813173510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-813173510} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:22:31,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-1774198909 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1774198909 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1774198909 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1774198909 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1774198909 |P2Thread1of1ForFork0_#t~ite41_Out-1774198909|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1774198909|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1774198909, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1774198909, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1774198909, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1774198909} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1774198909, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1774198909, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1774198909, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1774198909, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1774198909|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:22:31,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In1476891503 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1476891503 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1476891503 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1476891503 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1476891503| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1476891503 |P1Thread1of1ForFork2_#t~ite12_Out1476891503|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1476891503, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1476891503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1476891503} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1476891503, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1476891503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1476891503|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1476891503} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:22:31,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In77656374 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In77656374 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out77656374|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In77656374 |P1Thread1of1ForFork2_#t~ite13_Out77656374|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out77656374|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:22:31,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-518629399 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-518629399 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-518629399 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-518629399 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-518629399|)) (and (= ~a$r_buff1_thd2~0_In-518629399 |P1Thread1of1ForFork2_#t~ite14_Out-518629399|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-518629399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-518629399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518629399} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-518629399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-518629399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518629399, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-518629399|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:22:31,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:22:31,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-2144801074 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-2144801074 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-2144801074| ~a$r_buff0_thd3~0_In-2144801074)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-2144801074| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2144801074, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2144801074} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2144801074, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2144801074, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2144801074|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:22:31,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-430261310 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-430261310 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-430261310 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-430261310 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-430261310|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-430261310 |P2Thread1of1ForFork0_#t~ite43_Out-430261310|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-430261310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-430261310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430261310} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-430261310|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-430261310, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430261310, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-430261310, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430261310} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:22:31,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:22:31,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:22:31,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In677168881 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In677168881 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In677168881 |ULTIMATE.start_main_#t~ite47_Out677168881|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out677168881| ~a$w_buff1~0_In677168881) (not .cse1)))) InVars {~a~0=~a~0_In677168881, ~a$w_buff1~0=~a$w_buff1~0_In677168881, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In677168881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In677168881} OutVars{~a~0=~a~0_In677168881, ~a$w_buff1~0=~a$w_buff1~0_In677168881, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out677168881|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In677168881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In677168881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:22:31,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:22:31,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In71004450 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In71004450 256) 0))) (or (and (= ~a$w_buff0_used~0_In71004450 |ULTIMATE.start_main_#t~ite49_Out71004450|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out71004450|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In71004450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In71004450} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In71004450, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out71004450|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In71004450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:22:31,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In210456709 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In210456709 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In210456709 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In210456709 256) 0))) (or (and (= ~a$w_buff1_used~0_In210456709 |ULTIMATE.start_main_#t~ite50_Out210456709|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out210456709|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In210456709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out210456709|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In210456709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210456709, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In210456709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In210456709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:22:31,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-67243437 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-67243437 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-67243437|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-67243437 |ULTIMATE.start_main_#t~ite51_Out-67243437|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-67243437, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-67243437} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-67243437|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-67243437, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-67243437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:22:31,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1178105438 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1178105438 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1178105438 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In1178105438 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1178105438|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd0~0_In1178105438 |ULTIMATE.start_main_#t~ite52_Out1178105438|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1178105438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1178105438, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1178105438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178105438} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1178105438|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1178105438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1178105438, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1178105438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178105438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:22:31,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:22:31,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:22:31 BasicIcfg [2019-12-27 05:22:31,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:22:31,792 INFO L168 Benchmark]: Toolchain (without parser) took 139993.87 ms. Allocated memory was 145.2 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 101.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,792 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 917.70 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.26 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,794 INFO L168 Benchmark]: Boogie Preprocessor took 62.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,794 INFO L168 Benchmark]: RCFGBuilder took 880.11 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.5 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,794 INFO L168 Benchmark]: TraceAbstraction took 138019.48 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 05:22:31,797 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.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 917.70 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.26 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 880.11 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.5 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138019.48 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t263, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t264, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t265, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 137.6s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9606 SDtfs, 14876 SDslu, 36188 SDs, 0 SdLazy, 13721 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 50 SyntacticMatches, 14 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 649166 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1770 NumberOfCodeBlocks, 1770 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 336149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...